Two-colorings of normed spaces with no long monochromatic unit arithmetic progressions
From MaRDI portal
Publication:2680434
Recommendations
- Two-Colorings of Normed Spaces without Long Monochromatic Unit Arithmetic Progressions
- On the chromatic number of with an arbitrary norm
- Colorings of the space \(\mathbb R^{n}\) with several forbidden distances
- Monochromatic progressions in random colorings
- scientific article; zbMATH DE number 866014
Cites work
- A new proof of the Larman-Rogers upper bound for the chromatic number of the Euclidean space
- A Partition Property of Simplices in Euclidean Space
- All finite sets are Ramsey in the maximum norm
- Asymptotics of the independence number of a random subgraph of the graph \(G(n,r,<s)\)
- Borsuk's problem and the chromatic numbers of some metric spaces
- Estimate of the number of edges in subgraphs of a Johnson graph
- Euclidean Ramsey theorems. I
- Exponentially Ramsey sets
- scientific article; zbMATH DE number 3489127 (Why is no real title available?)
- Large cycles in random generalized Johnson graphs
- Lines in Euclidean Ramsey theory
- Monochromatic equilateral triangles in the unit distance graph
- Odd-distance and right-equidistant sets in the maximum and Manhattan metrics
- On the chromatic number of a space
- On the chromatic number of with an arbitrary norm
- Permutation Groups in Euclidean Ramsey Theory
- Ramsey theory in the \(n\)-space with Chebyshev metric
- The chromatic number of a space with the metric l_q
- The chromatic number of the plane is at least 5
- Upper bounds for the chromatic numbers of Euclidean spaces with forbidden Ramsey sets
Cited in
(3)
This page was built for publication: Two-colorings of normed spaces with no long monochromatic unit arithmetic progressions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2680434)
