On the potentially \(P_k\)-graphic sequences

DOI10.1016/S0012-365X(98)00182-4zbMath0928.05015OpenAlexW2505417355MaRDI QIDQ1296991

Jiong-Sheng Li, Zi-Xia Song

Publication date: 9 January 2000

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

Full work available at URL: https://doi.org/10.1016/s0012-365x(98)00182-4

zbMATH Keywords

cliquedegree sequenceextremal problemTurán numbergraphic sequenceTurán theorem

Mathematics Subject Classification ID

Vertex degrees (05C07)

Related Items (4)

Exact solution to an extremal problem on graphic sequences with a realization containing every 2-tree on \(k\) vertices ⋮ Potentially K m — G-graphical sequences: A survey ⋮ A variation of a conjecture due to Erdös and Sós ⋮ An extremal problem on graphic sequences with a realization containing every \(\ell \)-tree on \(k\) vertices

Cites Work

• Algorithms for constructing graphs and digraphs with given valences and factors
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the potentially \(P_k\)-graphic sequences