Large complete minors in random subgraphs (Q5886102): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q2743189 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paths and cycles in random subgraphs of graphs with large minimum degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: The order of the largest complete minor in a random graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introduction to Random Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Non-Planarity of a Random Subgraph / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Threshold Probability for Long Cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probability Inequalities for Sums of Bounded Random Variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4519896 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3333070 / 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: Finding and Using Expanders in Locally Sparse Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Expanders – how to find them, and what to find in them / rank
 
Normal rank
Property / cites work
 
Property / cites work: Long paths and cycles in random subgraphs of graphs with large minimum degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring complete bipartite graphs from random lists / rank
 
Normal rank
Property / cites work
 
Property / cites work: Long paths and cycles in random subgraphs of \(\mathcal{H}\)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The phase transition in random graphs: A simple proof / rank
 
Normal rank
Property / cites work
 
Property / cites work: Long cycles in random subgraphs of graphs with large minimum degree / 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: The extremal function for complete minors / rank
 
Normal rank

Latest revision as of 19:43, 31 July 2024

scientific article; zbMATH DE number 7670418
Language Label Description Also known as
English
Large complete minors in random subgraphs
scientific article; zbMATH DE number 7670418

    Statements

    Large complete minors in random subgraphs (English)
    0 references
    0 references
    0 references
    0 references
    30 March 2023
    0 references
    binomial random graph model
    0 references
    random subgraph
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references