On the chromatic number of an infinitesimal plane layer

DOI10.1090/spmj/1515zbMath1393.05117arXiv1512.06444OpenAlexW2884544251WikidataQ129458747 ScholiaQ129458747MaRDI QIDQ4580441

Vsevolod Aleksandrovich Voronov, Alexei Kanel-Belov, Danila Cherkashin

Publication date: 15 August 2018

Published in: St. Petersburg Mathematical Journal (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1512.06444

zbMATH Keywords

chromatic number of the planechromatic number of Euclidean spaces

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Erd?s problems and related topics of discrete geometry (52C10) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (12)

Turán-type results for distance graphs in an infinitesimal plane layer ⋮ 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 Frankl–Rödl theorem ⋮ 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 \(\ell_1\) and \(\ell_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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fractional and \(j\)-fold coloring of the plane
• The realization of distances in measurable subsets covering \(R^ n\).
• Coloring abelian groups
• Axiom of choice and chromatic number of the plane
• \(\varepsilon\)-unit distance graphs
• A 15-colouring of 3-space omitting distance one
• On the space chromatic number
• New lower bound for the chromatic number of a rational space with one and two forbidden distances
• On the chromatic number of subsets of the Euclidean plane
• Realization of all distances in a decomposition of the space \(R^ n\) into \(n+1\) parts
• Distances realized by sets covering the plane
• Borsuk's problem and the chromatic numbers of some metric spaces
• The Hadwiger–Nelson Problem
• Coloring Distance Graphs and Graphs of Diameters
• A counterexample to Borsuk’s conjecture
• Research Problems in Discrete Geometry
• On the colouring of spheres embedded in $ \mathbb R^n$
• The Mathematical Coloring Book
• Tearing a strip off the plane
• On the chromatic number of a space
• A new lower bound for the chromatic number of the rational space
• The realization of distances within sets in Euclidean space
• On the chromatic numbers of small-dimensional Euclidean spaces

This page was built for publication: On the chromatic number of an infinitesimal plane layer