Lower bounds for the independence numbers of some distance graphs with vertices in \(\{-1,0,1\}^n\)
From MaRDI portal
Publication:845157
DOI10.1134/S1064562409040243zbMath1210.05065MaRDI QIDQ845157
V. K. Lyubimov, Andrei M. Raigorodskii
Publication date: 5 February 2010
Published in: Doklady Mathematics (Search for Journal in Brave)
Extremal problems in graph theory (05C35) Distance in graphs (05C12) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (3)
On the measurable chromatic number of a space of dimension \(n \leq 24\) ⋮ 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
This page was built for publication: Lower bounds for the independence numbers of some distance graphs with vertices in \(\{-1,0,1\}^n\)
