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

DOI10.1007/S10255-006-0321-8zbMath1106.05031OpenAlexW2105375349MaRDI QIDQ2431967

Meng-Xiao Yin

Publication date: 24 October 2006

Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10255-006-0321-8

zbMATH Keywords

degree sequence

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Vertex degrees (05C07)

Related Items (2)

On potentially K 5-H-graphic sequences ⋮ Potentially K m — G-graphical sequences: A survey

Cites Work

• The Erdős-Jacobson-Lehel conjecture on potentially \(P_k\)-graphic sequence is true
• An extremal problem on the potentially \(P_k\)-graphic sequences
• Algorithms for constructing graphs and digraphs with given valences and factors
• Two sufficient conditions for a graphic sequence to have a realization with prescribed clique size
• Asymptotic upper bounds for Ramsey functions
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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