On a conjecture about trees in graphs with large girth

被引：3

作者：

Jiang, T ^{[1
]}

机构：

[1] Michigan Technol Univ, Dept Math Sci, Houghton, MI 49931 USA

来源：

JOURNAL OF COMBINATORIAL THEORY SERIES B | 2001年 / 83卷 / 02期

关键词：

trees; girth;

D O I：

10.1006/jctb.2001.2049

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

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 less than or equal to3. In this paper, we prove Dobson's conjecture. (C) 2001 Academic Press.

引用

页码：221 / 232

页数：12

共 50 条

[31] Cayley type graphs and cubic graphs of large girth
Bray, J
Parker, C
Rowley, P
DISCRETE MATHEMATICS, 2000, 214 (1-3) : 113 - 121
[32] LARGE-GIRTH ROOTS OF GRAPHS
Adamaszek, Anna
Adamaszek, Micha L.
27TH INTERNATIONAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE (STACS 2010), 2010, 5 : 35 - 46
[33] LARGE-GIRTH ROOTS OF GRAPHS
Adamaszek, Anna
Adamaszek, Micha L.
SIAM JOURNAL ON DISCRETE MATHEMATICS, 2010, 24 (04) : 1501 - 1514
[34] Secret sharing on large girth graphs
Csirmaz, Laszlo
Ligeti, Peter
CRYPTOGRAPHY AND COMMUNICATIONS-DISCRETE-STRUCTURES BOOLEAN FUNCTIONS AND SEQUENCES, 2019, 11 (03): : 399 - 410
[35] Generalized arboricity of graphs with large girth
Bartnicki, Tomasz
Bosek, Bartlomiej
Czerwinski, Sebastian
Farnik, Michal
Grytczuk, Jaroslaw
Miechowicz, Zofia
DISCRETE MATHEMATICS, 2019, 342 (05) : 1343 - 1350
[36] Well-indumatched trees and graphs of bounded girth
Akbari, S.
Ekim, T.
Ghodrati, A. H.
Zare, S.
AUSTRALASIAN JOURNAL OF COMBINATORICS, 2023, 85 : 61 - 81
[37] Large independent sets in regular graphs of large girth
Lauer, Joseph
Wormald, Nicholas
JOURNAL OF COMBINATORIAL THEORY SERIES B, 2007, 97 (06) : 999 - 1009
[38] COPS AND ROBBERS IN GRAPHS WITH LARGE GIRTH AND CAYLEY GRAPHS.
Frankl, Peter
1600, (17):
[39] Uniquely colourable graphs and the hardness of colouring graphs of large girth
Emden-Weinert, T
Hougardy, S
Kreuter, B
COMBINATORICS PROBABILITY & COMPUTING, 1998, 7 (04): : 375 - 386
[40] Chen-Chvátal's conjecture for graphs with restricted girth
Montejano, Luis Pedro
QUAESTIONES MATHEMATICAE, 2024, 47 (09) : 1827 - 1850

← 1 2 3 4 5 →