Monochromatic paths for the integers
From MaRDI portal
Abstract: Recall that van der Waerden's theorem states that any finite coloring of the naturals has arbitrarily long monochromatic arithmetic sequences. We explore questions about the set of differences of those sequences.
Recommendations
Cites work
- Avoiding Monochromatic Sequences With Special Gaps
- Combinatorial Proofs of the Polynomial van der Waerden Theorem and the Polynomial Hales-Jewett Theorem
- Distance graphs with finite chromatic number
- scientific article; zbMATH DE number 6378629 (Why is no real title available?)
- scientific article; zbMATH DE number 850181 (Why is no real title available?)
- Large independent sets in shift-invariant graphs
- On a conjecture of Brown concerning accessible sets
- On the Set of Common Differences in van der Waerden’s Theorem on Arithmetic Progressions
- Polynomial extensions of van der Waerden’s and Szemerédi’s theorems
Cited in
(12)- Fractional meanings of nonrepetitiveness
- Down the large rabbit hole
- Infinite monochromatic paths and a theorem of Erdős-Hajnal-Rado
- Monochromatic infinite paths
- Colorful arithmetic sequences
- Distance graphs and arithmetic progressions
- scientific article; zbMATH DE number 3902684 (Why is no real title available?)
- scientific article; zbMATH DE number 1185305 (Why is no real title available?)
- Monochromatic Paths and Triangulated Graphs
- scientific article; zbMATH DE number 2061965 (Why is no real title available?)
- On the Canonical Version of a Theorem in Ramsey Theory
- Hitting sets and colorings of hypergraphs
This page was built for publication: Monochromatic paths for the integers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q739070)