Density of monochromatic infinite subgraphs
Louis DeBiasio, Paul McKenney

TL;DR
This paper investigates the density of monochromatic infinite subgraphs in edge-colored infinite complete graphs, improving known bounds for paths and extending results to directed paths, trees, and locally finite graphs.
Contribution
It improves the lower bound for the density of monochromatic paths from 2/3 to 3/4 and establishes a tight bound of 2/3, also extending results to other graph types.
Findings
Monochromatic path density improved to at least 3/4.
Established a tight bound of 2/3 for path density.
Extended results to directed paths, trees, and locally finite graphs.
Abstract
For any countably infinite graph , Ramsey's theorem guarantees an infinite monochromatic copy of in any -coloring of the edges of the countably infinite complete graph . Taking this a step further, it is natural to wonder how "large" of a monochromatic copy of we can find with respect to some measure -- for instance, the density (or upper density) of the vertex set of in the positive integers. Unlike finite Ramsey theory, where this question has been studied extensively, the analogous problem for infinite graphs has been mostly overlooked. In one of the few results in the area, Erd\H{o}s and Galvin proved that in every 2-coloring of , there exists a monochromatic path whose vertex set has upper density at least , but it is not possible to do better than . They also showed that for some sequence , there exists a…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
