On a conjecture about trees in graphs with large girth
Document Type
Article
Publication Date
1-1-2001
Department
Department of Mathematical Sciences
Abstract
The girth of a graph G is the length of a shortest cycle in G. Dobson (1994, Ph.D. dissertation, Louisiana State University, Baton Rouge, LA) conjectured that every graph G with girth at least 2t + 1 and minimum degree at least k/t contains every tree T with k edges whose maximum degree does not exceed the minimum degree of G. The conjecture has been proved for t≤3. In this paper, we prove Dobson's conjecture.
Publication Title
Journal of Combinatorial Theory. Series B
Recommended Citation
Jiang, T.
(2001).
On a conjecture about trees in graphs with large girth.
Journal of Combinatorial Theory. Series B,
83(2), 221-232.
http://doi.org/10.1006/jctb.2001.2049
Retrieved from: https://digitalcommons.mtu.edu/michigantech-p/3966
