The largest hole in sparse random graphs (Q6052472): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q2798999 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The size Ramsey number of a directed path / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random minimum length spanning trees in regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The chromatic number of random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cliques in random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On independent sets in random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large Induced Matchings in Random Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independent Sets in Random Graphs from the Weighted Second Moment Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Induced Paths, Holes and Trees in Random Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trees in random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Induced trees in sparse random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4894603 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the independence number of random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large holes in sparse random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large induced trees in sparse random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Limits of local algorithms over sparse random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On colouring random 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: Q4726290 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The size of the largest hole in a random graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximal induces trees in sparse random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local algorithms for independent sets are half-optimal / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3816113 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sharp concentration of the chromatic number on random graphs \(G_{n,p}\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: On large induced trees and long induced paths in sparse random graphs / rank
 
Normal rank

Revision as of 06:12, 3 August 2024

scientific article; zbMATH DE number 7751087
Language Label Description Also known as
English
The largest hole in sparse random graphs
scientific article; zbMATH DE number 7751087

    Statements

    The largest hole in sparse random graphs (English)
    0 references
    0 references
    0 references
    0 references
    17 October 2023
    0 references
    hole
    0 references
    induced path
    0 references
    random graph
    0 references

    Identifiers