Equitable two-colorings of uniform hypergraphs (Q458597)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6352225
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Equitable two-colorings of uniform hypergraphs |
scientific article; zbMATH DE number 6352225 |
Statements
Equitable two-colorings of uniform hypergraphs (English)
0 references
8 October 2014
0 references
probabilistic algorithms
0 references
parallel algorithms
0 references
\(n\)-uniform hypergraph
0 references
Lovász local lemma
0 references
2-coloring
0 references
0.9104238152503968
0 references
0.8867989182472229
0 references
0.8831732869148254
0 references
0.8812220692634583
0 references
0.8734665513038635
0 references
