Two sufficient conditions for a graphic sequence to have a realization with prescribed clique size
From MaRDI portal
Publication:2581629
DOI10.1016/j.disc.2005.03.028zbMath1119.05025OpenAlexW2066233716MaRDI QIDQ2581629
Publication date: 10 January 2006
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2005.03.028
Related Items (31)
Graphic sequences with a realization containing intersecting cliques ⋮ New sufficient conditions on the degree sequences of uniform hypergraphs ⋮ A note on the potential function of an arbitrary graph H ⋮ The potential-Ramsey number of $K_n$ and $K_t^{-k}$ ⋮ New results on degree sequences of uniform hypergraphs ⋮ A characterization for a graphic sequence to be potentially \(C_{r}\)-graphic ⋮ Solution to a general version of a degree sequence variant of the Erdős-Sós conjecture ⋮ The smallest degree sum that yields potentially \(K_{r+1}-K_3\)-graphic sequences ⋮ A characterization for a sequence to be potentially \({K_{r+1}-e}\)-graphic ⋮ Chromatic number and complete graph substructures for degree sequences ⋮ A note on packing of graphic \(n\)-tuples ⋮ Exact solution to an extremal problem on graphic sequences with a realization containing every 2-tree on \(k\) vertices ⋮ Graphic sequences and split graphs ⋮ On the sum necessary to ensure that a degree sequence is potentially \(H\)-graphic ⋮ Recognition of split-graphic sequences ⋮ Graphic sequences with a realization containing cycles \(C_3, \dots, C_\ell \) ⋮ A new lower bound on the potential-Ramsey number of two graphs ⋮ Stability of the Potential Function ⋮ Graphic sequences with a realization containing a union of cliques ⋮ Graphic sequences with a realization containing a generalized friendship graph ⋮ Graphic sequences with a realization containing a complete multipartite subgraph ⋮ On potentially K 5-H-graphic sequences ⋮ Potentially K m — G-graphical sequences: A survey ⋮ On potentially H-graphic sequences ⋮ A degree sequence variant of graph Ramsey numbers ⋮ On the potential function of an arbitrary graph \(H\) ⋮ A variation of a conjecture due to Erdös and Sós ⋮ An extremal problem on graphic sequences with a realization containing every \(\ell \)-tree on \(k\) vertices ⋮ A sharp refinement of a result of Zverovich-Zverovich ⋮ An Erdős-Stone Type Conjecture for Graphic Sequences ⋮ Combinatorial properties of degree sequences of 3-uniform hypergraphs arising from Saind arrays
Cites Work
This page was built for publication: Two sufficient conditions for a graphic sequence to have a realization with prescribed clique size
