Name
Abstract | ||
|---|---|---|
Any r -edge-coloured n -vertex complete graph K n contains at most r monochromatic trees, all of different colours, whose vertex sets partition the vertex set of K n , provided n ⩾3 r 4 r ! (1−1/ r ) 3(1− r ) log r . This comes close to proving, for large n , a conjecture of Erdős, Gyárfás, and Pyber, which states that r −1 trees suffice for all n . |
Year | DOI | Venue |
|---|---|---|
1996 | 10.1006/jctb.1996.0065 | J. Comb. Theory, Ser. B |
Keywords | Field | DocType |
monochromatic tree,complete graph | Discrete mathematics,Monochromatic color,Combinatorics,Vertex (geometry),Partition (number theory),Conjecture,Mathematics | Journal |
Volume | Issue | ISSN |
68 | 2 | Journal of Combinatorial Theory, Series B |
Citations | PageRank | References |
13 | 2.25 | 0 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| P. E. Haxell | 1 | 212 | 26.40 |
| Yoshiharu Kohayakawa | 2 | 172 | 22.74 |