The \((p, q)\)-extremal problem and the fractional chromatic number of Kneser hypergraphs (Q2629296)
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: The (p, q)-extremal problem and the fractional chromatic number of Kneser hypergraphs |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The \((p, q)\)-extremal problem and the fractional chromatic number of Kneser hypergraphs |
scientific article |
Statements
The \((p, q)\)-extremal problem and the fractional chromatic number of Kneser hypergraphs (English)
0 references
5 July 2016
0 references
Kneser hypergraphs
0 references
fractional chromatic number
0 references
Erdős-Ko-Rado
0 references
extremal graph theory
0 references
\((p, q)\)-property
0 references
0 references
0.7836953401565552
0 references
0.7793578505516052
0 references
0.7790400981903076
0 references
0.7783557772636414
0 references
0.7763881683349609
0 references
