Name
Abstract | ||
|---|---|---|
Gyarfas conjectured in 2011 that every r-edge-colored K n contains a monochromatic component of bounded ("perhaps three") diameter on at least n / ( r - 1 ) vertices. Letzter proved this conjecture with diameter four. In this note we improve the result in the case of r = 3: We show that in every 3-edge-coloring of K n either there is a monochromatic component of diameter at most three on at least n / 2 vertices or every color class is spanning and has diameter at most four. |
Year | DOI | Venue |
|---|---|---|
2022 | 10.1002/jgt.22739 | JOURNAL OF GRAPH THEORY |
Keywords | DocType | Volume |
diameter, monochromatic component, Ramsey theory | Journal | 99 |
Issue | ISSN | Citations |
2 | 0364-9024 | 0 |
PageRank | References | Authors |
0.34 | 0 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Erik Carlson | 1 | 0 | 0.34 |
| Ryan R. Martin | 2 | 0 | 0.34 |
| Bo Peng | 3 | 0 | 0.34 |
| M. Ruszinkó | 4 | 230 | 35.16 |