On the chromatic number of slices without monochromatic unit arithmetic progressions

DOI10.22405/2226-8383-2023-24-4-78-84MaRDI QIDQ6498966

Valeriya Orlanovna Kirova

Publication date: 8 May 2024

Published in: Chebyshevskiĭ Sbornik (Search for Journal in Brave)

zbMATH Keywords

chromatic numberHadwiger-Nelson problem

Mathematics Subject Classification ID

Ramsey theory (05D10) Arithmetic progressions (11B25)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Euclidean Ramsey theorems. I
• A 15-colouring of 3-space omitting distance one
• Character sums over integers with restricted \(g\)-ary digits
• The chromatic number of the plane is at least 5: a new proof
• A new proof of the Larman-Rogers upper bound for the chromatic number of the Euclidean space
• The Mathematical Coloring Book
• Tearing a strip off the plane
• On the chromatic number of a space
• The chromatic number of the plane is at least 5
• On the chromatic number of an infinitesimal plane layer
• All finite sets are Ramsey in the maximum norm
• The realization of distances within sets in Euclidean space
• Solution to a conjecture of Schmidt and Tuller on one-dimensional packings and coverings
• Two-Colorings of Normed Spaces without Long Monochromatic Unit Arithmetic Progressions

This page was built for publication: On the chromatic number of slices without monochromatic unit arithmetic progressions