On coloring uniform hypergraphs without 3-cycles (Q446271)
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: On coloring uniform hypergraphs without 3-cycles |
scientific article; zbMATH DE number 6077901
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On coloring uniform hypergraphs without 3-cycles |
scientific article; zbMATH DE number 6077901 |
Statements
On coloring uniform hypergraphs without 3-cycles (English)
0 references
5 September 2012
0 references
sparse hypergraphs
0 references
hypergraph colorings
0 references
random recoloring method
0 references
0.8914840221405029
0 references
0.8734932541847229
0 references
0.8730095624923706
0 references
0.8660113215446472
0 references
0.8586167097091675
0 references
