Monochromatic components in edge-coloured graphs with large minimum degree
For every n∈N and k≥2, Gyárfás showed that every k-edge-colouring of the complete graph on n vertices contains a monochromatic connected component of order at least n/(k-1). For k≥3, Gyárfás and Sárközy proved tha...
| Main Authors: | , |
|---|---|
| Format: | Journal article |
| Language: | English |
| Published: |
Electronic Journal of Combinatorics
2021
|