New lower bounds for the independence numbers of distance graphs with vertices in \(\{-1,0,1\}^{n}\) (Q650424)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: New lower bounds for the independence numbers of distance graphs with vertices in \(\{-1,0,1\}^{n}\) |
scientific article; zbMATH DE number 5980775
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | New lower bounds for the independence numbers of distance graphs with vertices in \(\{-1,0,1\}^{n}\) |
scientific article; zbMATH DE number 5980775 |
Statements
New lower bounds for the independence numbers of distance graphs with vertices in \(\{-1,0,1\}^{n}\) (English)
0 references
25 November 2011
0 references
distance graph
0 references
independence number
0 references
Borsuk problem
0 references
Nelson-Erdős-Hadwiger problem
0 references
