The order of the largest complete minor in a random graph (Q5900071): Difference between revisions

From MaRDI portal
Changed label, description and/or aliases in en, and other parts
Merged Item from Q5900255
 
description / endescription / en
 
scientific article; zbMATH DE number 5320781
Property / zbMATH Open document ID
 
Property / zbMATH Open document ID: 1230.05261 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1002/rsa.20215 / rank
 
Normal rank
Property / published in
 
Property / published in: Random Structures & Algorithms / rank
 
Normal rank
Property / publication date
 
4 September 2008
Timestamp+2008-09-04T00:00:00Z
Timezone+00:00
CalendarGregorian
Precision1 day
Before0
After0
Property / publication date: 4 September 2008 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 60C05 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 5320781 / rank
 
Normal rank
Property / zbMATH Keywords
 
random graphs
Property / zbMATH Keywords: random graphs / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2950392961 / rank
 
Normal rank

Latest revision as of 10:16, 6 May 2024

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
    0 references
    0 references
    0 references
    0 references
    0 references
    5 June 2008
    0 references
    4 September 2008
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    extremal problem
    0 references
    graph minors
    0 references
    random graphs
    0 references
    0 references
    0 references
    0 references