The threshold for the Erdős, Jacobson and Lehel conjecture to be true

DOI10.1007/s10114-005-0676-4zbMath1105.05014OpenAlexW2091762241WikidataQ122956858 ScholiaQ122956858MaRDI QIDQ2508636

Jian Hua Yin, Jiong-Sheng Li

Publication date: 13 October 2006

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

Full work available at URL: https://doi.org/10.1007/s10114-005-0676-4

zbMATH Keywords

complete graphsdegree sequencegraphic sequence

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Extremal problems in graph theory (05C35) Combinatorial optimization (90C27) Vertex degrees (05C07)

Related Items

Graphic sequences with a realization containing intersecting cliques, A Gale-Ryser type characterization of potentially \(K_{s,t}\)-bigraphic pairs, A characterization for a graphic sequence to be potentially \(C_{r}\)-graphic, Graphic sequences with a realization containing a generalized friendship graph, Potentially K m — G-graphical sequences: A survey, A variation of a conjecture due to Erdös and Sós

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
• Unnamed Item
• Unnamed Item
• Unnamed Item