The smallest degree sum that yields potentially \(K_{r,r}\)-graphic sequences

DOI10.1007/BF02879985zbMath1099.05505OpenAlexW4244007514WikidataQ123124630 ScholiaQ123124630MaRDI QIDQ2503791

Jiong-Sheng Li, Jian Hua Yin

Publication date: 22 September 2006

Published in: Science in China. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02879985

zbMATH Keywords

degree sequenceextremal problemTurán number

Mathematics Subject Classification ID

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

Related Items (11)

Graphic sequences with a realization containing intersecting cliques ⋮ A variation of a classical Turán-type extremal problem ⋮ Degree complete graphs ⋮ A note on the potential function of an arbitrary graph H ⋮ Potentially \(K_{r_{1},r_{2},\dots ,r_{l},r,s}\)-graphic sequences ⋮ Solution to a general version of a degree sequence variant of the Erdős-Sós conjecture ⋮ 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 the potential function of an arbitrary graph \(H\) ⋮ An Erdős-Stone Type Conjecture for Graphic Sequences

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The iteration of cubic polynomials. II: Patterns and parapatterns
• Invariant sets under iteration of rational functions
• On the dynamics of polynomial-like mappings
• On a theorem of Fatou
• Julia and John

This page was built for publication: The smallest degree sum that yields potentially \(K_{r,r}\)-graphic sequences