New lower bounds for the independence numbers of distance graphs with vertices in \(\{-1,0,1\}^{n}\)
From MaRDI portal
Publication:650424
DOI10.1134/S0001434611010366zbMath1238.05200MaRDI QIDQ650424
V. F. Moskva, Andrei M. Raigorodskii
Publication date: 25 November 2011
Published in: Mathematical Notes (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\) ⋮ Erdős-Ko-Rado theorem for \(\{0,\pm 1\}\)-vectors ⋮ 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: New lower bounds for the independence numbers of distance graphs with vertices in \(\{-1,0,1\}^{n}\)
