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

DOI10.1134/S0001434617090218MaRDI QIDQ679870zbMATH OpenOpenAlexFDO

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

Cites work

• scientific article; zbMATH DE number 5935733 (Why is no real title available?)
• scientific article; zbMATH DE number 1943977 (Why is no real title available?)
• scientific article; zbMATH DE number 1406330 (Why is no real title available?)
• A new lower bound for the chromatic number of the rational space
• Borsuk's problem and the chromatic numbers of some metric spaces
• Coloring distance graphs and graphs of diameters
• New lower bound for the chromatic number of a rational space with one and two forbidden distances
• On the chromatic number of a space
• Research Problems in Discrete Geometry
• The Mathematical Coloring Book
• The chromatic number of a space with the metric $ l_q$
• The realization of distances within sets in Euclidean space

Cited in

(5)

• The chromatic number of a space with the metric $ l_q$
• New lower bound for the chromatic number of a rational space with one and two forbidden distances
• Chromatic numbers of distance graphs without short odd cycles in rational spaces
• Distance graphs with large chromatic number and without cliques of given size in the rational space
• Counterexamples to Borsuk's conjecture with large girth

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

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