Chromatic numbers of distance graphs with several forbidden distances and without cliques of a given size

DOI10.1134/S0032946018010064MaRDI QIDQ2190920zbMATH OpenOpenAlexWikidataFDO

Authors Alexey V. Berdnikov

Publication date 23 June 2020

Published in Problems of Information Transmission (Search for Journal in Brave)

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

zbMATH Keywords

coloringforbidden distances

Mathematics Subject Classification ID

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

Recommendations

• Distance graphs with large chromatic number and without large cliques
• Explicit and probabilistic constructions of distance graphs with small clique numbers and large chromatic numbers
• The chromatic number of Rn$\mathbb {R}^{n}$ with multiple forbidden distances

Cites work

• Codes with forbidden distances
• Distance graph on \(\mathbb Z^n\) with \(\ell_{1}\) norm
• Distance graphs with large chromatic number and without large cliques
• Estimate for the chromatic number of Euclidean space with several forbidden distances
• Estimating the chromatic numbers of Euclidean space by convex minimization methods
• Explicit and probabilistic constructions of distance graphs with small clique numbers and large chromatic numbers
• Graph Theory and Probability
• scientific article; zbMATH DE number 6009961 (Why is no real title available?)
• scientific article; zbMATH DE number 3577144 (Why is no real title available?)
• scientific article; zbMATH DE number 3068973 (Why is no real title available?)
• Intersection theorems with geometric consequences
• On distance graphs with large chromatic number but without large simplices
• On the chromatic number of a space
• On the chromatic number of with an arbitrary norm
• Small clique and large chromatic number
• The chromatic number of a space with the metric l_q
• The probabilistic method. With an appendix on the life and work of Paul Erdős.
• The realization of distances within sets in Euclidean space

Cited in

(8)

• Chromatic numbers of spheres
• Distance graphs with large chromatic number and without large cliques
• Distance graphs with large chromatic number and without cliques of given size in the rational space
• scientific article; zbMATH DE number 7633241 (Why is no real title available?)
• Explicit and probabilistic constructions of distance graphs with small clique numbers and large chromatic numbers
• The chromatic number of Rn$\mathbb {R}^{n}$ with multiple forbidden distances
• Chromatic number of a line with geometric progressions of forbidden distances and the complexity of recognizing distance graphs
• Chromatic numbers of 3-dimensional distance graphs containing no tetrahedra

This page was built for publication: Chromatic numbers of distance graphs with several forbidden distances and without cliques of a given size

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