Upper bounds for the chromatic numbers of Euclidean spaces with forbidden Ramsey sets
From MaRDI portal
Publication:1646366
DOI10.1134/S000143461801025XzbMATH Open1390.05071OpenAlexW2793386660WikidataQ130182279 ScholiaQ130182279MaRDI QIDQ1646366FDOQ1646366
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
Recommendations
- Estimate for the chromatic number of Euclidean space with several forbidden distances
- A new proof of the Larman-Rogers upper bound for the chromatic number of the Euclidean space
- scientific article; zbMATH DE number 861441
- An upper bound for the total chromatic number
- New lower bound for the chromatic number of a rational space with one and two forbidden distances
- On the chromatic numbers of metric spaces with few forbidden distances
- Upper bounds for Ramsey numbers
- An Upper Bound for Constrained Ramsey Numbers
- On the chromatic number of a space with a forbidden regular simplex
- Some upper bounds on ordinal-valued Ramsey numbers for colourings of pairs
Cites Work
- On the ratio of optimal integral and fractional covers
- Borsuk's problem and the chromatic numbers of some metric spaces
- Coloring Distance Graphs and Graphs of Diameters
- The Mathematical Coloring Book
- On the chromatic number of a space
- The realization of distances within sets in Euclidean space
- Euclidean Ramsey theorems. I
- Title not available (Why is that?)
- Covering space with convex bodies
- All Triangles are Ramsey
- Simultaneous Packing and Covering in Euclidean Space
- Improvement of the Frankl-Rödl theorem on the number of edges in hypergraphs with forbidden cardinalities of edge intersections
- A Partition Property of Simplices in Euclidean Space
- 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 a space with forbidden equilateral triangle
- Covering the \(n\)-space by convex bodies and its chromatic number
- Permutation Groups in Euclidean Ramsey Theory
- On the chromatic number of with an arbitrary norm
- All regular polytopes are Ramsey
- Lower bounds for the chromatic numbers of distance graphs with large girth
- The chromatic number of space with forbidden regular simplex
- On some covering problems in geometry
- On a Frankl-Rödl theorem and its geometric corollaries
- On the chromatic number of a space with a forbidden regular simplex
Cited In (19)
- Yet another species of forbidden-distances chromatic number
- A new proof of the Larman-Rogers upper bound for the chromatic number of the Euclidean space
- Title not available (Why is that?)
- On a Frankl-Wilson theorem
- Estimating the chromatic numbers of Euclidean space by convex minimization methods
- New lower bound for the chromatic number of a rational space with one and two forbidden distances
- On a Frankl-Wilson theorem and its geometric corollaries
- All finite sets are Ramsey in the maximum norm
- Chromatic numbers of spheres
- The chromatic number of Rn$\mathbb {R}^{n}$ with multiple forbidden distances
- A remark on lower bounds for the chromatic numbers of spaces of small dimension with metrics \(\ell_1\) and \(\ell_2\)
- Max-norm Ramsey theory
- Improved Frankl-Rödl theorem and some of its geometric consequences
- On the Frankl–Rödl theorem
- A new connection between two kinds of Euclidean coloring problems
- Two-colorings of normed spaces with no long monochromatic unit arithmetic progressions
- Two-Colorings of Normed Spaces without Long Monochromatic Unit Arithmetic Progressions
- Exponentially Ramsey sets
- On the chromatic numbers corresponding to exponentially Ramsey sets
This page was built for publication: Upper bounds for the chromatic numbers of Euclidean spaces with forbidden Ramsey sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1646366)
