A variation of a conjecture due to Erdös and Sós

DOI10.1007/s10114-009-7260-2zbMath1229.05161OpenAlexW2054556180WikidataQ123123707 ScholiaQ123123707MaRDI QIDQ1034303

Jiong-Sheng Li, Jian Hua Yin

Publication date: 11 November 2009

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

Full work available at URL: https://doi.org/10.1007/s10114-009-7260-2

zbMATH Keywords

graphdegree sequenceErdös-Sós conjecture

Mathematics Subject Classification ID

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

Related Items (10)

A further result on the potential-Ramsey number of G1 and G2 ⋮ The potential-Ramsey number of $K_n$ and $K_t^{-k}$ ⋮ Solution to a general version of a degree sequence variant of the Erdős-Sós conjecture ⋮ Exact solution to an extremal problem on graphic sequences with a realization containing every 2-tree on \(k\) vertices ⋮ On the sum necessary to ensure that a degree sequence is potentially \(H\)-graphic ⋮ A sufficient degree condition for a graph to contain all trees of size \(k\) ⋮ A new lower bound on the potential-Ramsey number of two graphs ⋮ Stability of the Potential Function ⋮ A degree sequence variant of graph Ramsey numbers ⋮ An extremal problem on graphic sequences with a realization containing every \(\ell \)-tree on \(k\) vertices

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The Erdős-Jacobson-Lehel conjecture on potentially \(P_k\)-graphic sequence is true
• On the potentially \(P_k\)-graphic sequences
• The Erdös-Sós conjecture for graphs without \(C_ 4\)
• An extremal problem on potentially \(K_{r,s}\)-graphic sequences
• The Erdős-Sós conjecture for graphs whose complements contain no \(C_4\)
• The Erdös-Sós conjecture for graphs of girth 5
• An extremal problem on the potentially \(P_k\)-graphic sequences
• The threshold for the Erdős, Jacobson and Lehel conjecture to be true
• 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
• On maximal paths and circuits of graphs
• [https://portal.mardi4nfdi.de/wiki/Publication:4865531 On the Erd�s-S�s conjecture]

This page was built for publication: A variation of a conjecture due to Erdös and Sós