On the chromatic numbers of integer and rational lattices

DOI10.1007/s10958-016-2806-1zbMath1343.05065arXiv1206.1934OpenAlexW1563336873MaRDI QIDQ289743

Vassily O. Manturov

Publication date: 31 May 2016

Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1206.1934

zbMATH Keywords

chromatic number for integer lattices

Mathematics Subject Classification ID

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

Related Items (2)

A triangle-free, 4-chromatic \(\mathbb{Q}^3\) Euclidean distance graph Scavenger hunt! ⋮ Borsuk's partition problem and finite point sets

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Distance graph on \(\mathbb Z^n\) with \(\ell_{1}\) norm
• Intersection theorems with geometric consequences
• Realization of all distances in a decomposition of the space \(R^ n\) into \(n+1\) parts
• Borsuk's problem and the chromatic numbers of some metric spaces
• Research Problems in Discrete Geometry
• On the colouring of spheres embedded in $ \mathbb R^n$
• Solving a linear equation in a set of integers I
• The chromatic number of a space with the metric $ l_q$
• Solving a linear equation in a set of integers II
• The realization of distances within sets in Euclidean space

This page was built for publication: On the chromatic numbers of integer and rational lattices