Transitive sets in Euclidean Ramsey theory
From MaRDI portal
Publication:654894
DOI10.1016/j.jcta.2011.09.005zbMath1232.05224arXiv1012.1350OpenAlexW2026183660MaRDI QIDQ654894
Imre Leader, Paul A. Russell, Mark Walters
Publication date: 23 December 2011
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1012.1350
Related Items (max. 100)
ALMOST ALL SETS OF POINTS ON THE ‐SPHERE ARE NOT SUBTRANSITIVE ⋮ A Ramsey characterisation of eventually periodic words ⋮ Exactly \(m\)-coloured complete infinite subgraphs ⋮ On a Frankl-Wilson theorem ⋮ Two-Colorings of Normed Spaces without Long Monochromatic Unit Arithmetic Progressions ⋮ A HALES–JEWETT TYPE PROPERTY OF FINITE SOLVABLE GROUPS ⋮ Max-norm Ramsey theory ⋮ Ramsey theory in the -space with Chebyshev metric ⋮ Suborbits in Knaster's problem ⋮ Simplices and regular polygonal tori in Euclidean Ramsey theory ⋮ All finite sets are Ramsey in the maximum norm
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- All regular polytopes are Ramsey
- All trapezoids are Ramsey
- Recent trends in Euclidean Ramsey theory
- Euclidean Ramsey theorems. I
- Finite subtransitive sets
- A Partition Property of Simplices in Euclidean Space
- All Triangles are Ramsey
- Regularity and Positional Games
- Permutation Groups in Euclidean Ramsey Theory
This page was built for publication: Transitive sets in Euclidean Ramsey theory
