Distances forbidden by two-colorings of \(\mathbb{Q}^ 3\) and \(A_ n\)

DOI10.1016/0012-365X(93)90481-8zbMath0771.05035OpenAlexW2109192835MaRDI QIDQ1801691

Timothy Y. Chow

Publication date: 20 June 1993

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

Full work available at URL: https://doi.org/10.1016/0012-365x(93)90481-8

zbMATH Keywords

distancestwo-coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12)

Related Items (4)

Unnamed Item ⋮ A triangle-free, 4-chromatic \(\mathbb{Q}^3\) Euclidean distance graph Scavenger hunt! ⋮ Unnamed Item ⋮ On Single-Distance Graphs on the Rational Points in Euclidean Spaces

Cites Work

• Two-colorings of a dense subgroup of \({\mathbb{Q}}^ n\) that forbid many distances
• Distances forbidden by some two-coloring of \(\mathbb{Q}^ 2\)
• Unnamed Item

This page was built for publication: Distances forbidden by two-colorings of \(\mathbb{Q}^ 3\) and \(A_ n\)