How many random edges make a dense hypergraph non-2-colorable? (Q3503605): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claim: author (P16): Item:Q1584432 |
||
| Property / author | |||
| Property / author: Benjamin Sudakov / rank | |||
Revision as of 17:45, 28 February 2024
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
