On the independence number of distance graphs with vertices in \-1,0,1\^n

DOI10.1134/S0001434609110169MaRDI QIDQ845206zbMATH OpenFDO

Authors Alexander Guterman, V. K. Lyubimov, S. A. Usachev, Andrei M. Raigorodskii

Publication date 5 February 2010

Published in Mathematical Notes (Search for Journal in Brave)

zbMATH Keywords

incidence matrixindependence numbervertex degreedistance graph

Mathematics Subject Classification ID

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

Cited in

(5)

• On the measurable chromatic number of a space of dimension \(n \leq 24\)
• 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 chromatic number of \(\mathbb{R}^{9}\)
• A remark on lower bounds for the chromatic numbers of spaces of small dimension with metrics _1 and _2
• Turán-type results for distance graphs in an infinitesimal plane layer

This page was built for publication: On the independence number 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 Q845206)