Upper bounds for the chromatic numbers of Euclidean spaces with forbidden Ramsey sets
From MaRDI portal
Publication:1646366
DOI10.1134/S000143461801025XzbMath1390.05071OpenAlexW2793386660WikidataQ130182279 ScholiaQ130182279MaRDI QIDQ1646366
Publication date: 25 June 2018
Published in: Mathematical Notes (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s000143461801025x
Related Items (13)
The chromatic number of Rn$\mathbb {R}^{n}$ with multiple forbidden distances ⋮ On a Frankl-Wilson theorem ⋮ 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 ⋮ On the chromatic numbers corresponding to exponentially Ramsey sets ⋮ On the Frankl–Rödl theorem ⋮ Chromatic numbers of spheres ⋮ 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\) ⋮ Improved Frankl-Rödl theorem and some of its geometric consequences ⋮ All finite sets are Ramsey in the maximum norm
Cites Work
- Unnamed Item
- Improvement of the Frankl-Rödl theorem on the number of edges in hypergraphs with forbidden cardinalities of edge intersections
- Improvements of the Frankl-Rödl theorem on the number of edges of a hypergraph with forbidden intersections, and their consequences in the problem of finding the chromatic number of a space with forbidden equilateral triangle
- On the chromatic number of with an arbitrary norm
- The chromatic number of space with forbidden regular simplex
- All regular polytopes are Ramsey
- Covering the \(n\)-space by convex bodies and its chromatic number
- On the ratio of optimal integral and fractional covers
- Euclidean Ramsey theorems. I
- On a Frankl-Rödl theorem and its geometric corollaries
- On the chromatic number of a space with a forbidden regular simplex
- Lower bounds for the chromatic numbers of distance graphs with large girth
- Borsuk's problem and the chromatic numbers of some metric spaces
- On some covering problems in geometry
- Coloring Distance Graphs and Graphs of Diameters
- A Partition Property of Simplices in Euclidean Space
- The Mathematical Coloring Book
- All Triangles are Ramsey
- Permutation Groups in Euclidean Ramsey Theory
- On the chromatic number of a space
- On the chromatic number of a space with forbidden equilateral triangle
- Covering space with convex bodies
- The realization of distances within sets in Euclidean space
- Simultaneous Packing and Covering in Euclidean Space
This page was built for publication: Upper bounds for the chromatic numbers of Euclidean spaces with forbidden Ramsey sets
