Graphic sequences with a realization containing a union of cliques

DOI10.1007/s00373-007-0737-9zbMath1123.05028OpenAlexW1972537263MaRDI QIDQ995771

Michael Ferrara

Publication date: 10 September 2007

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-007-0737-9

zbMATH Keywords

Degree sequence

Mathematics Subject Classification ID

Vertex degrees (05C07)

Related Items (9)

Graphic sequences with a realization containing intersecting cliques ⋮ A note on the potential function of an arbitrary graph H ⋮ 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 ⋮ Graphic sequences with a realization containing a generalized friendship graph ⋮ Potentially K m — G-graphical sequences: A survey ⋮ On the potential function of an arbitrary graph \(H\) ⋮ tK\(_p\)-saturated graphs of minimum size ⋮ An Erdős-Stone Type Conjecture for Graphic Sequences

Cites Work

• The Erdős-Jacobson-Lehel conjecture on potentially \(P_k\)-graphic sequence is true
• An extremal problem on potentially \(K_{r,s}\)-graphic sequences
• The smallest degree sum that yields potentially \(K_{r,r}\)-graphic sequences
• Two sufficient conditions for a graphic sequence to have a realization with prescribed clique size
• A remark on the existence of finite graphs
• On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I
• A General Lower Bound for Potentially H-Graphic Sequences
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Graphic sequences with a realization containing a union of cliques