Coloring abelian groups

DOI10.1016/0012-365X(82)90122-4MaRDI QIDQ1164049zbMATH OpenOpenAlexFDO

Authors P. 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)

Cites work

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

Cited in

(9)

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

This page was built for publication: Coloring abelian groups

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