On lower bounds of the order of $k$-chromatic unit distance graphs

arXiv2303.14714MaRDI QIDQ6430886

Jaan Parts, Aubrey D. N. J. de Grey

Publication date: 26 March 2023

Abstract: Here we give refined numerical values for the minimum number of vertices of $k$-chromatic unit distance graphs in the Euclidean plane.

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12)

This page was built for publication: On lower bounds of the order of $k$-chromatic unit distance graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6430886)