Chromatic numbers of distance graphs with several forbidden distances and without cliques of a given size
From MaRDI portal
Publication:2190920
DOI10.1134/S0032946018010064zbMath1457.05032OpenAlexW2802510591WikidataQ129984114 ScholiaQ129984114MaRDI QIDQ2190920
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
Related Items (2)
The chromatic number of Rn$\mathbb {R}^{n}$ with multiple forbidden distances ⋮ Chromatic numbers of spheres
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Estimate for the chromatic number of Euclidean space with several forbidden distances
- Distance graph on \(\mathbb Z^n\) with \(\ell_{1}\) norm
- On the chromatic number of with an arbitrary norm
- Intersection theorems with geometric consequences
- Distance graphs with large chromatic numbers and small clique numbers
- Distance graphs with large chromatic number and without large cliques
- Codes with forbidden distances
- Small clique and large chromatic number
- Graph Theory and Probability
- On distance graphs with large chromatic number but without large simplices
- Estimating the chromatic numbers of Euclidean space by convex minimization methods
- On the chromatic number of a space
- The chromatic number of a space with the metric $ l_q$
- Explicit and probabilistic constructions of distance graphs with small clique numbers and large chromatic numbers
- The realization of distances within sets in Euclidean space
This page was built for publication: Chromatic numbers of distance graphs with several forbidden distances and without cliques of a given size
