Triangle colorings require at least seven colors

DOI10.1016/j.disc.2021.112411zbMath1466.05076arXiv1909.02708OpenAlexW3141219140MaRDI QIDQ2032735

Michael N. Manta

Publication date: 14 June 2021

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

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

zbMATH Keywords

combinatoricsdiscrete geometrychromatic number of the plane

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Combinatorial aspects of tessellation and tiling problems (05B45) Tilings in (2) dimensions (aspects of discrete geometry) (52C20)

Cites Work

• Every 5-coloured map in the plane contains a monochrome unit
• The realization of distances in measurable subsets covering \(R^ n\).
• The chromatic number of the plane is at least 5: a new proof
• Distances realized by sets covering the plane
• On the Nelson Unit Distance Coloring Problem
• The Mathematical Coloring Book
• The chromatic number of the plane is at least 5
• On the chromatic number of plane tilings