New lower bounds for the independence numbers of distance graphs with vertices in \(\{-1,0,1\}^{n}\) (Q650424): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 08:51, 30 January 2024
scientific article
| 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 |
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
