Birth of a giant \((k_{1},k_{2})\)-core in the random digraph (Q515812): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / arXiv ID
 
Property / arXiv ID: 1608.05095 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385084 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3344024 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Almost all graphs with 1.44n edges are 3-colorable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3059475 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic normality of the \(k\)-core in random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The transitive closure of a random digraph / rank
 
Normal rank
Property / cites work
 
Property / cites work: The phase transition in the evolution of random digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Size and connectivity of the \(k\)-core of a random graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: The critical behavior of random digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cores in random hypergraphs and Boolean formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic enumeration of strongly connected digraphs by vertices and edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting strongly-connected, moderately sparse directed graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic distribution of the numbers of vertices and arcs of the giant strong component in sparse random digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting strongly connected (<i>k</i><sub>1</sub>, <i>k</i><sub>2</sub>)‐directed cores / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sudden emergence of a giant \(k\)-core in a random graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting connected graphs inside-out / rank
 
Normal rank
Property / cites work
 
Property / cites work: The<i>k</i>-Core and Branching Processes / rank
 
Normal rank

Latest revision as of 14:15, 13 July 2024

scientific article
Language Label Description Also known as
English
Birth of a giant \((k_{1},k_{2})\)-core in the random digraph
scientific article

    Statements

    Birth of a giant \((k_{1},k_{2})\)-core in the random digraph (English)
    0 references
    16 March 2017
    0 references
    threshold number of edges
    0 references
    0 references
    0 references

    Identifiers

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