An extremal problem on the potentially \(P_k\)-graphic sequences
From MaRDI portal
Publication:1971211
DOI10.1016/S0012-365X(99)00289-7zbMath0944.05024MaRDI QIDQ1971211
Publication date: 15 September 2000
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items (20)
Graphic sequences with a realization containing intersecting cliques ⋮ A variation of a classical Turán-type extremal problem ⋮ A note on the potential function of an arbitrary graph H ⋮ A Gale-Ryser type characterization of potentially \(K_{s,t}\)-bigraphic pairs ⋮ 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 ⋮ Graphic sequences and split graphs ⋮ Recognition of split-graphic sequences ⋮ On multigraphic and potentially multigraphic sequences ⋮ The threshold for the Erdős, Jacobson and Lehel conjecture to be true ⋮ Graphic sequences with a realization containing a generalized friendship graph ⋮ Potentially K m — G-graphical sequences: A survey ⋮ On potentially H-graphic sequences ⋮ On the potential function of an arbitrary graph \(H\) ⋮ A generalization of a conjecture due to Erdös, Jacobson and Lehel ⋮ A variation of a conjecture due to Erdös and Sós ⋮ Conditions for \(r\)-graphic sequences to be potentially \(K^{(r)}_{m+1}\)-graphic ⋮ Two sufficient conditions for a graphic sequence to have a realization with prescribed clique size ⋮ A sufficient condition for r - graphic sequences to be potentially
This page was built for publication: An extremal problem on the potentially \(P_k\)-graphic sequences
