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

From MaRDI portal
Merged Item from Q5900255
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3950589 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The longest path in a random graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2743189 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topological cliques of random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hadwiger's conjecture is true for almost every graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5315023 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the conjecture of Hajos / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bound of the Hadwiger number of graphs by their average degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minors in expanding graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Structure of a Random Graph at the Point of the Phase Transition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3128907 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An extremal function for contractions of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3768936 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The extremal function for complete minors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3887496 / rank
 
Normal rank

Latest revision as of 10:21, 28 June 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
    5 June 2008
    0 references
    4 September 2008
    0 references
    extremal problem
    0 references
    graph minors
    0 references
    random graphs
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references