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 (Q2342346)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | 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 |
scientific article |
Statements
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 (English)
0 references
11 May 2015
0 references
graph
0 references
hypergraph
0 references
independence number
0 references
chromatic number
0 references
distance graph
0 references
Hamming distance
0 references
Nelson-Erdős-Hadwiger problem
0 references
