Lower bounds for the independence numbers of some distance graphs with vertices in \-1,0,1\^n

DOI10.1134/S1064562409040243MaRDI QIDQ845157zbMATH OpenFDO

Authors V. K. Lyubimov, Andrei M. Raigorodskii

Publication date 5 February 2010

Published in Doklady Mathematics (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Distance in graphs (05C12) Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites work

• On Ramsey Type Problems in Combinatorial Geometry

Cited in

(4)

• A remark on lower bounds for the chromatic numbers of spaces of small dimension with metrics _1 and _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
• On the measurable chromatic number of a space of dimension \(n \leq 24\)
• Lower bounds for the independence numbers of distance graphs with vertices in \(\{-1,0,1\}^n\)

This page was built for publication: Lower bounds for the independence numbers of some distance graphs with vertices in \(\{-1,0,1\}^n\)

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