How many random edges make a dense hypergraph non-2-colorable? (Q3503605)
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 5285050
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | How many random edges make a dense hypergraph non-2-colorable? |
scientific article; zbMATH DE number 5285050 |
Statements
How many random edges make a dense hypergraph non-2-colorable? (English)
0 references
5 June 2008
0 references
random hypergraphs
0 references
2-colorability
0 references
smoothed analysis
0 references
0.864675760269165
0 references
0.843316912651062
0 references
0.8420051336288452
0 references
0.8263212442398071
0 references
0.8186112642288208
0 references
