On a conjecture about trees in graphs with large girth

DOI10.1006/JCTB.2001.2049zbMath1023.05035OpenAlexW2069185010MaRDI QIDQ1850563

Tao Jiang

Publication date: 10 December 2002

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/590d9a0458e004f380383b76f1878074772f77cb

Mathematics Subject Classification ID

Trees (05C05)

Related Items (2)

A randomized embedding algorithm for trees ⋮ A note on the Size-Ramsey number of long subdivisions of graphs

Cites Work

• On graphs which contain each tree of given size
• The Erdös-Sós conjecture for graphs without \(C_ 4\)
• Embedding trees into graphs of large girth
• The Erdös-Sós conjecture for graphs of girth 5
• The Komlós conjecture for graphs of girth 7
• [https://portal.mardi4nfdi.de/wiki/Publication:4865531 On the Erd�s-S�s conjecture]
• Unnamed Item

This page was built for publication: On a conjecture about trees in graphs with large girth