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

DOI10.26493/1855-3974.905.CB4zbMath1386.05032arXiv1403.5430OpenAlexW1557582405WikidataQ122947414 ScholiaQ122947414MaRDI QIDQ4597481

Long-Tu Yuan, Xiao Dong Zhang

Publication date: 13 December 2017

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

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

zbMATH Keywords

treeconjecturemaximum degreeErdős-Sós conjecture

Mathematics Subject Classification ID

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

Related Items (2)

An \(A_{\alpha}\)-spectral Erdős-Sós theorem ⋮ A variation of the Erdős-Sós conjecture in bipartite graphs

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