On a conjecture about trees in graphs with large girth

DOI10.1006/JCTB.2001.2049zbMATH Open1023.05035OpenAlexW2069185010MaRDI QIDQ1850563FDOQ1850563

Authors: 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

Recommendations

• Embedding trees into graphs of large girth
• On graphs which contain each tree of given size
• scientific article; zbMATH DE number 1792598
• The Erdös-Sós conjecture for graphs of girth 5
• The tree number of a graph with a given girth

Mathematics Subject Classification ID

Trees (05C05)

Cites Work

• The Erdös-Sós conjecture for graphs without \(C_ 4\)
• The Erdös-Sós conjecture for graphs of girth 5
• The Komlós conjecture for graphs of girth 7
• On the Erd�s-S�s conjecture
• Title not available (Why is that?)
• Embedding trees into graphs of large girth
• On graphs which contain each tree of given size

Cited In (8)

• A randomized embedding algorithm for trees
• The tree number of a graph with a given girth
• High girth augmented trees are huge
• Questions, conjectures, and data about multiplicity lists for trees
• A note on the Size-Ramsey number of long subdivisions of graphs
• Girth and treewidth
• Well-indumatched Trees and Graphs of Bounded Girth
• Strong 2-degenerate graph embeddings

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

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