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 this page instead for the normal view: How many random edges make a dense hypergraph non-2-colorable? |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | How many random edges make a dense hypergraph non-2-colorable? |
scientific article |
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
