Coloring abelian groups

DOI10.1016/0012-365X(82)90122-4zbMath0485.05009OpenAlexW2024633642MaRDI QIDQ1164049

Peter D. jun. Johnson

Publication date: 1982

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

Full work available at URL: https://doi.org/10.1016/0012-365x(82)90122-4

zbMATH Keywords

chromatic numberEuclidean Ramsey theory

Mathematics Subject Classification ID

Combinatorial aspects of partitions of integers (05A17) Generalized Ramsey theory (05C55)

Related Items (9)

Lifting of a bound for the chromatic number of \(\mathbb R^n\) to higher dimensions ⋮ On the chromatic number of an infinitesimal plane layer ⋮ Clique numbers of finite unit-quadrance graphs ⋮ Two-colorings of a dense subgroup of \({\mathbb{Q}}^ n\) that forbid many distances ⋮ Connectivity of distance graphs ⋮ Additive \(k\)-colorable extensions of the rational plane ⋮ Distances forbidden by some two-coloring of \(\mathbb{Q}^ 2\) ⋮ Simple product colorings ⋮ On the connectedness of some geometric graphs

Cites Work

• Euclidean Ramsey theorems. I
• Distances realized by sets covering the plane

This page was built for publication: Coloring abelian groups