A new lower bound for the chromatic number of general Kneser hypergraphs (Q1750225)
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: A new lower bound for the chromatic number of general Kneser hypergraphs |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A new lower bound for the chromatic number of general Kneser hypergraphs |
scientific article |
Statements
A new lower bound for the chromatic number of general Kneser hypergraphs (English)
0 references
18 May 2018
0 references
independence number
0 references
Kneser's conjecture
0 references
colorful complete \(p\)-partite hypergraph
0 references
0.8716394305229187
0 references
0.8703386783599854
0 references
0.8398058414459229
0 references
0.8236410617828369
0 references
0.8215612769126892
0 references
