Lower bound for the chromatic number of a rational space with metric \(l_u\) and with one forbidden distance

DOI10.1134/S0001434617090218zbMath1386.05056OpenAlexW2766539318MaRDI QIDQ679870

Yury A. Demidovich

Publication date: 22 January 2018

Published in: Mathematical Notes (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0001434617090218

zbMATH Keywords

graphMinkowski metricchromatic number of the rational spaceforbidden distance

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (3)

Distance graphs with large chromatic number and without cliques of given size in the rational space ⋮ Chromatic numbers of distance graphs without short odd cycles in rational spaces ⋮ Counterexamples to Borsuk's conjecture with large girth

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• New lower bound for the chromatic number of a rational space with one and two forbidden distances
• Borsuk's problem and the chromatic numbers of some metric spaces
• Coloring Distance Graphs and Graphs of Diameters
• Research Problems in Discrete Geometry
• The Mathematical Coloring Book
• On the chromatic number of a space
• The chromatic number of a space with the metric $ l_q$
• A new lower bound for the chromatic number of the rational space
• The realization of distances within sets in Euclidean space

This page was built for publication: Lower bound for the chromatic number of a rational space with metric \(l_u\) and with one forbidden distance