Upper density of monochromatic infinite paths

Corsten, J., DeBiasio, L., Lamaison, A. & Lang, R. (2019). Upper density of monochromatic infinite paths. Advances in Combinatorics, 2019(4). https://doi.org/10.19086/aic.10810
Copy

We prove that in every 2-colouring of the edges of KN there exists a monochromatic infinite path P such that V(P) has upper density at least (12+ √ 8)/17 ≈ 0.87226 and further show that this is best possible. This settles a problem of Erdos and Galvin
Item Type Article
Copyright holders © 2019 The Authors
Departments LSE > Academic Departments > Mathematics
DOI 10.19086/aic.10810
Date Deposited 08 Jul 2020
URI https://researchonline.lse.ac.uk/id/eprint/105569

Explore Further

picture_as_pdf
subject
Published Version
Creative Commons: Attribution 4.0
Download

Export as

EndNote BibTeX Reference Manager Refer Atom Dublin Core JSON Multiline CSV
Export

Downloads
View more statistics