Density of monochromatic infinite paths (Q1627204): Difference between revisions
From MaRDI portal
Latest revision as of 11:49, 17 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Density of monochromatic infinite paths |
scientific article |
Statements
Density of monochromatic infinite paths (English)
0 references
22 November 2018
0 references
Summary: For any subset \(A \subseteq \mathbb{N}\), we define its upper density to be \(\limsup_{n\rightarrow\infty}|A \cap \{1,\ldots,n\}|/n\). We prove that every \(2\)-edge-colouring of the complete graph on \(\mathbb{N}\) contains a monochromatic infinite path, whose vertex set has upper density at least \((9+\sqrt{17})/16\approx 0.82019\). This improves on results of \textit{P. Erdős} and \textit{F. Galvin} [Discrete Math. 113, No. 1--3, 59--70 (1993; Zbl 0787.05071)], and of \textit{L. DeBiasio} and \textit{P. McKenney} [``Density of monochromatic infinite subgraphs'', Combinatorica (to appear)].
0 references
infinite paths
0 references
Ramsey theory
0 references
density of monochromatic subgraphs
0 references
0 references