New lower bounds for the independence numbers of distance graphs with vertices in \(\{-1,0,1\}^{n}\) (Q650424): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 00:52, 5 March 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
