Coloring hypergraphs with bounded cardinalities of edge intersections (Q2297713)
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 7170090
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Coloring hypergraphs with bounded cardinalities of edge intersections |
scientific article; zbMATH DE number 7170090 |
Statements
Coloring hypergraphs with bounded cardinalities of edge intersections (English)
0 references
20 February 2020
0 references
colorings of hypergraphs
0 references
\(b\)-simple hypergraphs
0 references
random recoloring method
0 references
0 references
0.9297977
0 references
0.9175705
0 references
0.91614366
0 references
0.9115034
0 references
0.91043466
0 references
0 references
