Name
Abstract | ||
|---|---|---|
Dobson (1994) conjectured that if G is a graph with girth no less than 2 t + 1 and minimum degree no less than k / t and Δ ( T ), then G contains each tree T of size k . It is known that this conjecture holds for t = 1 and t = 2. We prove it in the case t = 3. |
Year | DOI | Venue |
|---|---|---|
1997 | 10.1016/S0012-365X(97)84218-5 | Discrete Mathematics |
Field | DocType | Volume |
Discrete mathematics,Graph,Combinatorics,Conjecture,Mathematics | Journal | 165 |
ISSN | Citations | PageRank |
Discrete Mathematics | 1 | 0.44 |
References | Authors | |
3 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jean-François Saclé | 1 | 43 | 7.05 |
| Mariusz Woźniak | 2 | 204 | 34.54 |