How many random edges make a dense hypergraph non-2-colorable? (Q3503605): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2950781851 / rank | |||
Normal rank | |||
Property / arXiv ID | |||
Property / arXiv ID: 0707.0315 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Smoothed analysis of algorithms / rank | |||
Normal rank |
Latest revision as of 11:23, 28 June 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