Patch colorings and rigid colorings of the rational \(n\)-space

DOI10.1006/jctb.2001.2062zbMath1024.05030OpenAlexW2078703014MaRDI QIDQ1850575

Michał Morayne, Grzegorz M. Kubicki, Jenő Lehel

Publication date: 10 December 2002

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jctb.2001.2062

zbMATH Keywords

chromatic number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Extremal combinatorics (05D99)

Cites Work

• Unit-Distance Graphs in Minkowski metric spaces
• On the connectedness of some geometric graphs
• Two-colorings of a dense subgroup of \({\mathbb{Q}}^ n\) that forbid many distances
• On four-colourings of the rational four-space
• Modular elliptic curves and Fermat's Last Theorem
• Ring-theoretic properties of certain Hecke algebras
• On the connectivity of unit distance graphs
• Distances realized by sets covering the plane
• The realization of distances within sets in Euclidean space
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Patch colorings and rigid colorings of the rational \(n\)-space