Upper density of monochromatic infinite paths
Combinatorics
2019-10-24 v3
Abstract
We prove that in every -colouring of the edges of there exists a monochromatic infinite path such that has upper density at least and further show that this is best possible. This settles a problem of Erd\H{o}s and Galvin.
Keywords
Cite
@article{arxiv.1808.03006,
title = {Upper density of monochromatic infinite paths},
author = {Jan Corsten and Louis DeBiasio and Ander Lamaison and Richard Lang},
journal= {arXiv preprint arXiv:1808.03006},
year = {2019}
}
Comments
16 pages, 2 figures