A variation of a classical Turán-type extremal problem

DOI10.1016/j.ejc.2003.12.011zbMath1078.05045OpenAlexW1974938276MaRDI QIDQ1883610

Guo-Liang Chen, Jiong-Sheng Li, Jian Hua Yin

Publication date: 13 October 2004

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2003.12.011

zbMATH Keywords

degree sequencepotentially \(K_{r,s}\)-graphic sequence

Mathematics Subject Classification ID

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

Related Items

Potentially \(K_{r_{1},r_{2},\dots ,r_{l},r,s}\)-graphic sequences, A characterization for a graphic sequence to be potentially \(C_{r}\)-graphic, On the sum necessary to ensure that a degree sequence is potentially \(H\)-graphic, Potentially K m — G-graphical sequences: A survey, 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
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The Erdős-Jacobson-Lehel conjecture on potentially \(P_k\)-graphic sequence is true
• An extremal problem on potentially \(K_{r,s}\)-graphic sequences
• An extremal problem on the potentially \(P_k\)-graphic sequences
• The smallest degree sum that yields potentially \(K_{r,r}\)-graphic sequences
• Algorithms for constructing graphs and digraphs with given valences and factors
• An Upper Bound on Zarankiewicz' Problem
• On a problem of K. Zarankiewicz