On the infinitary van der Waerden Theorem
Shahram Mohsenipour

TL;DR
This paper provides a purely combinatorial proof of the infinitary van der Waerden's theorem, which concerns the existence of monochromatic arithmetic progressions in infinite colorings.
Contribution
It introduces a new combinatorial proof technique for the infinitary van der Waerden's theorem, avoiding analytical or topological methods used previously.
Findings
Established a purely combinatorial proof for the theorem
Confirmed the existence of monochromatic arithmetic progressions in infinite colorings
Simplified understanding of the infinitary van der Waerden's theorem
Abstract
We give a purely combinatorial proof for the infinitary van der Waerden's theorem.
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.
Taxonomy
TopicsLimits and Structures in Graph Theory · Advanced Topology and Set Theory · Advanced Graph Theory Research
