2000 character limit reached
Upper density of monochromatic infinite paths
Published 9 Aug 2018 in math.CO | (1808.03006v3)
Abstract: We prove that in every $2$-colouring of the edges of $K_\mathbb{N}$ there exists a monochromatic infinite path $P$ such that $V(P)$ has upper density at least ${(12+\sqrt{8})}/{17} \approx 0.87226$ and further show that this is best possible. This settles a problem of Erd\H{o}s and Galvin.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.