On the Erdős-Sós Conjecture for graphs on n = k + 4 vertices

DOI10.26493/1855-3974.905.CB4zbMATH Open1386.05032arXiv1403.5430OpenAlexW1557582405WikidataQ122947414 ScholiaQ122947414MaRDI QIDQ4597481FDOQ4597481

Long-Tu Yuan, Xiao-Dong Zhang

Publication date: 13 December 2017

Published in: Ars Mathematica Contemporanea (Search for Journal in Brave)

Abstract: The ErdH{o}s-S'{o}s Conjecture states that if $G$ is a simple graph of order $n$ with average degree more than $k-2,$ then $G$ contains every tree of order $k$. In this paper, we prove that ErdH{o}s-S'{o}s Conjecture is true for $n=k+4$.

Full work available at URL: https://arxiv.org/abs/1403.5430

zbMATH Keywords

treemaximum degreeconjectureErdős-Sós conjecture

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35)

Cited In (5)

• A variation of the Erdős-Sós conjecture in bipartite graphs
• The Erdős‐Sós Conjecture for trees of diameter four
• The Erdős-Sós conjecture for graphs whose complements contain no \(C_4\)
• An \(A_{\alpha}\)-spectral Erdős-Sós theorem
• Title not available (Why is that?)

This page was built for publication: On the Erdős-Sós Conjecture for graphs on n = k + 4 vertices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4597481)