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

DOI10.1134/S0001434611010366MaRDI QIDQ650424zbMATH OpenFDO

Authors V. F. Moskva, Andrei M. Raigorodskii

Publication date 25 November 2011

Published in Mathematical Notes (Search for Journal in Brave)

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

zbMATH Keywords

Borsuk problemdistance graphindependence numberNelson-Erdős-Hadwiger problem

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

• Excursions into combinatorial geometry
• On Ramsey Type Problems in Combinatorial Geometry

Cited in

(4)

• 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
• 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: New lower bounds for the independence numbers of 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 Q650424)