Upper density of monochromatic infinite paths

Abstract

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.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…