All finite sets are Ramsey in the maximum norm

DOI10.1017/fms.2021.50zbMath1471.05110arXiv2008.02008OpenAlexW3191619472MaRDI QIDQ5011684

Arsenii Sagdeev, Andrey B. Kupavskii

Publication date: 27 August 2021

Published in: Forum of Mathematics, Sigma (Search for Journal in Brave)

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

zbMATH Keywords

Euclidean Ramsey theorychromatic number of the planeNelson's problem

Mathematics Subject Classification ID

Erd?s problems and related topics of discrete geometry (52C10) Ramsey theory (05D10)

Related Items (8)

Solution to a conjecture of Schmidt and Tuller on one-dimensional packings and coverings ⋮ On Ramsey numbers for arbitrary sequences of graphs ⋮ Chromatic number of a line with geometric progressions of forbidden distances and the complexity of recognizing distance graphs ⋮ Odd-distance sets and right-equidistant sequences in the maximum and Manhattan metrics ⋮ Two-colorings of normed spaces with no long monochromatic unit arithmetic progressions ⋮ Two-Colorings of Normed Spaces without Long Monochromatic Unit Arithmetic Progressions ⋮ Max-norm Ramsey theory ⋮ New Turán type bounds for Johnson graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the chromatic number of with an arbitrary norm
• Transitive sets in Euclidean Ramsey theory
• All regular polytopes are Ramsey
• Intersection theorems with geometric consequences
• All trapezoids are Ramsey
• Euclidean Ramsey theorems. I
• Upper bounds for the chromatic numbers of Euclidean spaces with forbidden Ramsey sets
• The chromatic number of the plane is at least 5: a new proof
• On a Frankl-Wilson theorem
• Exponentially Ramsey sets
• A new proof of the Larman-Rogers upper bound for the chromatic number of the Euclidean space
• A remark on lower bounds for the chromatic numbers of spaces of small dimension with metrics \(\ell_1\) and \(\ell_2\)
• Borsuk's problem and the chromatic numbers of some metric spaces
• Coloring Distance Graphs and Graphs of Diameters
• A Partition Property of Simplices in Euclidean Space
• The Mathematical Coloring Book
• Permutation Groups in Euclidean Ramsey Theory
• On the chromatic number of a space
• The chromatic number of the plane is at least 5
• The chromatic number of a space with the metric $ l_q$
• Graph minimization, focusing on the example of 5-chromatic unit-distance graphs in the plane
• Monochromatic equilateral triangles in the unit distance graph
• Covering space with convex bodies
• The realization of distances within sets in Euclidean space
• On the chromatic numbers of small-dimensional Euclidean spaces

This page was built for publication: All finite sets are Ramsey in the maximum norm