The power of many colours
A classical problem, due to Gerencsér and Gyárfás from 1967, asks how large a monochromatic connected component can we guarantee in any r-edge colouring of $K_n$ ? We consider how big a connected component we can guarantee in any r-edge colouring of $K_n$ if we allow ourselves to use up...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Cambridge University Press
2024-01-01
|
| Series: | Forum of Mathematics, Sigma |
| Subjects: | |
| Online Access: | https://www.cambridge.org/core/product/identifier/S2050509424001208/type/journal_article |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|