Upper density of monochromatic infinite paths

DOI10.19086/AIC.10810MaRDI QIDQ5126750zbMATH OpenOpenAlexFDO

Authors Jan Corsten, Louis DeBiasio, Ander Lamaison, Richard Lang

Publication date 20 October 2020

Published in Advances in Combinatorics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://arxiv.org/abs/1808.03006

zbMATH Keywords

infinite graphregularity lemmaupper density

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55) Infinite graphs (05C63) Ramsey theory (05D10)

Abstract: We prove that in every $2$-colouring of the edges of $K_{m}athbbN$ there exists a monochromatic infinite path $P$ such that $V(P)$ has upper density at least $(12+sqrt8)/17approx0.87226$ and further show that this is best possible. This settles a problem of ErdH{o}s and Galvin.

Recommendations

• Density of monochromatic infinite paths
• Density of monochromatic infinite subgraphs
• Upper density of monochromatic paths in edge-coloured infinite complete graphs and bipartite graphs
• Monochromatic infinite paths
• Ramsey upper density of infinite graph factors

Cited in

(11)

• Density of monochromatic infinite paths
• Infinite monochromatic paths and a theorem of Erdős-Hajnal-Rado
• Density of monochromatic infinite subgraphs
• Monochromatic infinite paths
• The saturation number for the length of degree monotone paths
• Upper density of monochromatic paths in edge-coloured infinite complete graphs and bipartite graphs
• Ramsey upper density of infinite graph factors
• Unavoidable structures in infinite tournaments
• Ramsey upper density of infinite graphs
• Ramsey upper density of infinite graphs
• Density of monochromatic infinite subgraphs. II

This page was built for publication: Upper density of monochromatic infinite paths

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5126750)