The order of the largest complete minor in a random graph (Q5900071)
From MaRDI portal
(Redirected from Item:Q5900255)
| 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: The order of the largest complete minor in a random graph |
scientific article; zbMATH DE number 5320781
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The order of the largest complete minor in a random graph |
scientific article; zbMATH DE number 5320781 |
Statements
The order of the largest complete minor in a random graph (English)
0 references
5 June 2008
0 references
4 September 2008
0 references
extremal problem
0 references
graph minors
0 references
random graphs
0 references
0.9916167259216307
0 references
0.8702060580253601
0 references
0.8306654095649719
0 references
0.8102545738220215
0 references