On the chromatic number of an infinitesimal plane layer
From MaRDI portal
Abstract: We consider natural generalization of plane chromatic number problem. We consider chromatic numbers of spaces for arbitrary small . We prove that and . Also we consider natural questions, arising from this considerations.
Recommendations
Cites work
- -unit distance graphs
- A 15-colouring of 3-space omitting distance one
- A counterexample to Borsuk’s conjecture
- A new lower bound for the chromatic number of the rational space
- Axiom of choice and chromatic number of the plane
- Borsuk's problem and the chromatic numbers of some metric spaces
- Coloring abelian groups
- Coloring distance graphs and graphs of diameters
- Distances realized by sets covering the plane
- Fractional and \(j\)-fold coloring of the plane
- scientific article; zbMATH DE number 5935733 (Why is no real title available?)
- scientific article; zbMATH DE number 3145756 (Why is no real title available?)
- scientific article; zbMATH DE number 6536189 (Why is no real title available?)
- scientific article; zbMATH DE number 51916 (Why is no real title available?)
- scientific article; zbMATH DE number 653246 (Why is no real title available?)
- scientific article; zbMATH DE number 1017008 (Why is no real title available?)
- scientific article; zbMATH DE number 1943977 (Why is no real title available?)
- scientific article; zbMATH DE number 865991 (Why is no real title available?)
- scientific article; zbMATH DE number 1406330 (Why is no real title available?)
- scientific article; zbMATH DE number 3428210 (Why is no real title available?)
- New lower bound for the chromatic number of a rational space with one and two forbidden distances
- On the chromatic number of a space
- On the chromatic number of subsets of the Euclidean plane
- On the colouring of spheres embedded in R^n
- On the space chromatic number
- Realization of all distances in a decomposition of the space \(R^ n\) into \(n+1\) parts
- Research Problems in Discrete Geometry
- Tearing a strip off the plane
- The Hadwiger-Nelson problem
- The Mathematical Coloring Book
- The realization of distances in measurable subsets covering R^ n.
- The realization of distances within sets in Euclidean space
Cited in
(20)- Distance graphs with large chromatic number and without cliques of given size in the rational space
- 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 _1 and _2
- Refinement of lower bounds of the chromatic number of a space with forbidden one-color triangles
- The number of edges in induced subgraphs of some distance graphs
- On the chromatic number of random subgraphs of a certain distance graph
- Counterexamples to Borsuk's conjecture with large girth
- Turán-type results for distance graphs in an infinitesimal plane layer
- The vector graph and the chromatic number of the plane, or how not to prove that \(\chi(\mathbb E^2)>4\)
- On the Frankl-Rödl theorem
- scientific article; zbMATH DE number 865996 (Why is no real title available?)
- Coloring distance graphs on the plane
- Chromatic number of a line with geometric progressions of forbidden distances and the complexity of recognizing distance graphs
- On the chromatic number of 2-dimensional spheres
- On the chromatic number of slices without monochromatic unit arithmetic progressions
- Alekseĭ Yakovlevich Kanel'-Belov
- On a Frankl-Wilson theorem and its geometric corollaries
- Lower bounds for the independence numbers of distance graphs with vertices in \(\{-1,0,1\}^n\)
- On chromatic numbers of 3-dimensional slices
- Isomorphisms of unit distance graphs of layers
This page was built for publication: On the chromatic number of an infinitesimal plane layer
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4580441)