Upper density of monochromatic infinite paths

Corsten, Jan; DeBiasio, Louis; Lamaison, Ander; and Lang, Richard (2019) Upper density of monochromatic infinite paths Advances in Combinatorics, 2019 (4). ISSN 2517-5599

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
Keywords	PhD Studentship,EP/P002420/1
Departments	Mathematics
DOI	10.19086/aic.10810
Date Deposited	08 Jul 2020 10:12
URI	https://researchonline.lse.ac.uk/id/eprint/105569

Explore Further

QA Mathematics

http://www.lse.ac.uk/Mathematics/people/Research-Students/Jan-Corsten (Author)
https://www.advancesincombinatorics.com/ (Official URL)

picture_as_pdf

picture_as_pdf
subject: Published Version
: Available under Creative Commons: Attribution 4.0

Download

Atom

BibTeX

OpenURL ContextObject in Span

OpenURL ContextObject

Dublin Core

MPEG-21 DIDL

Data Cite XML

EndNote

HTML Citation

METS

MODS

RIOXX2 XML

Reference Manager

Refer

ASCII Citation

Export

Downloads