A new lower bound for the chromatic number of general Kneser hypergraphs (Q1750225): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 04:32, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
