Two-colorings of a dense subgroup of \({\mathbb{Q}}^ n\) that forbid many distances

DOI10.1016/0012-365X(90)90033-EzbMath0701.05005OpenAlexW2059169626WikidataQ127613808 ScholiaQ127613808MaRDI QIDQ913798

Peter D. jun. Johnson

Publication date: 1990

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

Full work available at URL: https://doi.org/10.1016/0012-365x(90)90033-e

zbMATH Keywords

partitionAbelian groupfour-colouring of \(Q^ 4\)two-colouring of \(Q^ 3\)

Mathematics Subject Classification ID

Combinatorial aspects of partitions of integers (05A17) Torsion-free groups, finite rank (20K15)

Related Items

Unnamed Item ⋮ A triangle-free, 4-chromatic \(\mathbb{Q}^3\) Euclidean distance graph Scavenger hunt! ⋮ Distances forbidden by two-colorings of \(\mathbb{Q}^ 3\) and \(A_ n\) ⋮ Distances forbidden by some two-coloring of \(\mathbb{Q}^ 2\) ⋮ Unnamed Item ⋮ Patch colorings and rigid colorings of the rational \(n\)-space ⋮ On Single-Distance Graphs on the Rational Points in Euclidean Spaces

Cites Work

• Coloring abelian groups
• Distances forbidden by some two-coloring of \(\mathbb{Q}^ 2\)
• Unnamed Item
• Unnamed Item