A General Lower Bound for Potentially H-Graphic Sequences

DOI10.1137/080715275zbMath1215.05036OpenAlexW2006455246MaRDI QIDQ5189535

John R. Schmitt, Michael Ferrara

Publication date: 17 March 2010

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/080715275

zbMATH Keywords

degree sequencepotentially graphic sequence\(H\)-saturated graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex degrees (05C07)

Related Items (12)

Graphic sequences with a realization containing intersecting cliques ⋮ A further result on the potential-Ramsey number of G1 and G2 ⋮ A note on the potential function of an arbitrary graph H ⋮ The potential-Ramsey number of $K_n$ and $K_t^{-k}$ ⋮ Solution to a general version of a degree sequence variant of the Erdős-Sós conjecture ⋮ On the sum necessary to ensure that a degree sequence is potentially \(H\)-graphic ⋮ A new lower bound on the potential-Ramsey number of two graphs ⋮ Graphic sequences with a realization containing a union of cliques ⋮ Graphic sequences with a realization containing a generalized friendship graph ⋮ A degree sequence variant of graph Ramsey numbers ⋮ On the potential function of an arbitrary graph \(H\) ⋮ An Erdős-Stone Type Conjecture for Graphic Sequences

This page was built for publication: A General Lower Bound for Potentially H-Graphic Sequences