Partitioning 2-coloured complete \(k\)-uniform hypergraphs into monochromatic \(\ell\)-cycles (Q1750222)
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: Partitioning 2-coloured complete k-uniform hypergraphs into monochromatic -cycles |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Partitioning 2-coloured complete \(k\)-uniform hypergraphs into monochromatic \(\ell\)-cycles |
scientific article |
Statements
Partitioning 2-coloured complete \(k\)-uniform hypergraphs into monochromatic \(\ell\)-cycles (English)
0 references
18 May 2018
0 references
Lehel's conjecture
0 references
\(k\)-uniform complete hypergraph
0 references
0 references
0.8792534470558167
0 references
0.8781558275222778
0 references
0.8688117861747742
0 references
0.8600414395332336
0 references
0.8598573803901672
0 references
