On the chromatic number of an infinitesimal plane layer

DOI10.1090/SPMJ/1515zbMATH Open1393.05117arXiv1512.06444OpenAlexW2884544251WikidataQ129458747 ScholiaQ129458747MaRDI QIDQ4580441FDOQ4580441

Vsevolod Aleksandrovich Voronov, A. Ya Belov, Danila Cherkashin

Publication date: 15 August 2018

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

Abstract: We consider natural generalization of plane chromatic number problem. We consider chromatic numbers $chi$ of spaces $mathbb{R}^{n}imes[0,varepsilon{]}^k$ for arbitrary small $varepsilon$. We prove that $5leqchi(mathbb{R}^{2}imes[0,varepsilon])leq7$ and $6leqchi(mathbb{R}^{2}imes[0,varepsilon{]}^2)leq7$. Also we consider natural questions, arising from this considerations.

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

Recommendations

• On the chromatic number of subsets of the Euclidean plane
• On the chromatic number of plane tilings
• scientific article; zbMATH DE number 865987
• scientific article; zbMATH DE number 1552837
• On the space chromatic number

zbMATH Keywords

chromatic number of the planechromatic number of Euclidean spaces

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (16)

• A new proof of the Larman-Rogers upper bound for the chromatic number of the Euclidean space
• On the chromatic number of 2-dimensional spheres
• On the chromatic number of random subgraphs of a certain distance graph
• Title not available (Why is that?)
• On a Frankl-Wilson theorem and its geometric corollaries
• Chromatic number of a line with geometric progressions of forbidden distances and the complexity of recognizing distance graphs
• Coloring distance graphs on the plane
• Distance graphs with large chromatic number and without cliques of given size in the rational space
• A remark on lower bounds for the chromatic numbers of spaces of small dimension with metrics \(\ell_1\) and \(\ell_2\)
• Counterexamples to Borsuk's conjecture with large girth
• On the Frankl–Rödl theorem
• Alekseĭ Yakovlevich Kanel'-Belov
• On the chromatic number of slices without monochromatic unit arithmetic progressions
• Turán-type results for distance graphs in an infinitesimal plane layer
• 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

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)