How many random edges make a dense graph hamiltonian? (Q4798179): Difference between revisions
From MaRDI portal
Created a new Item |
Created claim: Wikidata QID (P12): Q57401522, #quickstatements; #temporary_batch_1707252663060 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q57401522 / rank | |||
Normal rank | |||
Revision as of 02:47, 7 February 2024
scientific article; zbMATH DE number 1884739
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | How many random edges make a dense graph hamiltonian? |
scientific article; zbMATH DE number 1884739 |
Statements
How many random edges make a dense graph hamiltonian? (English)
0 references
19 March 2003
0 references
Hamilton cycle
0 references
random graph
0 references
random digraph
0 references
rotation method
0 references
