How many random edges make a dense hypergraph non-2-colorable? (Q3503605): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Changed an Item |
||
| Property / arXiv ID | |||
| Property / arXiv ID: 0707.0315 / rank | |||
Normal rank | |||
Revision as of 17:03, 19 April 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
