Potentially \(K_{r_{1},r_{2},\dots ,r_{l},r,s}\)-graphic sequences

DOI10.1016/J.DISC.2006.07.037zbMath1119.05026OpenAlexW2025040813MaRDI QIDQ870982

Jiong-Sheng Li, Jian Hua Yin

Publication date: 15 March 2007

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

Full work available at URL: https://doi.org/10.1016/j.disc.2006.07.037

zbMATH Keywords

degree sequenceTurán-type problemspotentially graphic sequence

Mathematics Subject Classification ID

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

Related Items (3)

Graphic sequences with a realization containing a complete multipartite subgraph ⋮ Potentially K m — G-graphical sequences: A survey ⋮ On the potential function of an arbitrary graph \(H\)

Cites Work

• An extremal problem on potentially \(K_{r,s}\)-graphic sequences
• A variation of a classical Turán-type extremal problem
• The smallest degree sum that yields potentially \(K_{r,r}\)-graphic sequences
• Algorithms for constructing graphs and digraphs with given valences and factors
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Potentially \(K_{r_{1},r_{2},\dots ,r_{l},r,s}\)-graphic sequences