Coloring distance graphs on the plane

DOI10.1016/j.disc.2023.113441zbMath1514.05057arXiv2201.04499OpenAlexW4376171089MaRDI QIDQ6046170

Joanna Chybowska-Sokół, Konstanty Junosza-Szaniawski, Krzysztof Węsek

Publication date: 15 May 2023

Published in: Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

coloringHadwiger-Nelson problemdistance graphs

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12)

Related Items

Odd distances in colourings of the plane

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
• On the chromatic number of \(\mathbb R^4\)
• Axiom of choice and chromatic number: Examples on the plane
• The fractional chromatic number of the plane
• Colouring the real line
• Colouring prime distance graphs
• The chromatic number of the plane: the bounded case
• On coloring the odd-distance graph
• Every 5-coloured map in the plane contains a monochrome unit
• The realization of distances in measurable subsets covering \(R^ n\).
• Connectivity of distance graphs
• All unit-distance graphs of order 6197 are 6-colorable
• Axiom of choice and chromatic number of the plane
• Upper bound on the circular chromatic number of the plane
• \(\varepsilon\)-unit distance graphs
• Axiom of choice and chromatic number of \(R^n\)
• Distance graphs with finite chromatic number
• The ``Bounded gaps between primes Polymath project -- a retrospective analysis
• Unit distance graphs with ambiguous chromatic number
• The odd-distance plane graph
• On the chromatic number of subsets of the Euclidean plane
• Distances realized by sets covering the plane
• Die Kugel als Körper extremaler Korona
• Constructing 5-chromatic unit distance graphs embedded in the Euclidean plane and two-dimensional spheres
• Representations of the all_different Predicate of Constraint Satisfaction in Integer Programming
• On Radial Colorings of Annuli
• The chromatic number of the plane is at least 5 -- a human-verifiable proof
• Finite $\epsilon$-unit distance graphs
• Coloring distance graphs: a few answers and many questions
• Circular Coloring the Plane
• On the Chromatic Numbers of and with Intervals of Forbidden Distances
• The Mathematical Coloring Book
• Tearing a strip off the plane
• The chromatic number of the plane is at least 5
• Computing Small Unit-Distance Graphs with Chromatic Number 5
• The Hadwiger-Nelson problem with two forbidden distances
• On the chromatic number of an infinitesimal plane layer
• On the density of sets of the Euclidean plane avoiding distance 1
• A 6-chromatic odd-distance graph in the plane
• A $6$-chromatic two-distance graph in the plane
• A small 6-chromatic two-distance graph in the plane
• What percent of the plane can be properly 5- and 6-colored?
• Graph minimization, focusing on the example of 5-chromatic unit-distance graphs in the plane
• Zero Sums on Unit Square Vertex Sets and Plane Colorings
• On the chromatic numbers of small-dimensional Euclidean spaces
• Measurable sets with excluded distances
• Chromatic numbers of Cayley graphs on \(\mathbb Z\) and recurrence