On the independence number of distance graphs with vertices in \(\{-1,0,1\}^n\)
From MaRDI portal
Publication:845206
DOI10.1134/S0001434609110169zbMath1210.05095MaRDI QIDQ845206
Alexander E. Guterman, V. K. Lyubimov, S. A. Usachev, Andrei M. Raigorodskii
Publication date: 5 February 2010
Published in: Mathematical Notes (Search for Journal in Brave)
Distance in graphs (05C12) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items
On the measurable chromatic number of a space of dimension \(n \leq 24\), Turán-type results for distance graphs in an infinitesimal plane layer, On the chromatic number of \(\mathbb{R}^{9}\), A remark on lower bounds for the chromatic numbers of spaces of small dimension with metrics \(\ell_1\) and \(\ell_2\), New upper bounds for the independence numbers of graphs with vertices in \(\{-1,0,1\}^n\) and their applications to problems of the chromatic numbers of distance graphs
Cites Work
