Name
Abstract | ||
|---|---|---|
This note proves that, given one member, T, of a particular family of radius-three trees, every radius-two, triangle-free graph, G, with large enough chromatic number contains an induced copy of T. |
Year | Venue | Field |
|---|---|---|
2006 | ARS COMBINATORIA | Discrete mathematics,Combinatorics,Beal's conjecture,Conjecture,Mathematics |
DocType | Volume | ISSN |
Journal | 79 | 0381-7032 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ryan R. Martin | 1 | 36 | 10.12 |