Expanders Are Universal for the Class of All Spanning Trees (Q4911172): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Random regular graphs of high degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Remarks on positional games. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Embedding Spanning Trees in Random Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local resilience of almost spanning trees in random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounding Ramsey numbers through large deviation inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Limit distribution for the existence of Hamiltonian cycles in a random graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Embedding nearly-spanning bounded degree trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse universal graphs for bounded‐degree graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sharp threshold for the appearance of certain spanning trees in random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse universal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamilton cycles in highly connected and expanding graphs / 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: Tree embeddings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Almost universal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamilton cycles in random subgraphs of pseudo-random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Expanding graphs contain all small trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximal Flow Through a Network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trees in sparse random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a combinatorial game / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universality of Random Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Universal Graphs for Spanning Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On graphs which contain all small trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Explicit sparse almost-universal graphs for ${\bf {{\cal G}(n, {k \over n})}}$ / rank
 
Normal rank
Property / cites work
 
Property / cites work: A randomized embedding algorithm for trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universal Graphs for Bounded-Degree Trees and Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ars combinatoria / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the maximum degree in a random tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uniform generation of random regular graphs of moderate degree / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2294714952 / rank
 
Normal rank

Latest revision as of 10:44, 30 July 2024

scientific article; zbMATH DE number 6144820
Language Label Description Also known as
English
Expanders Are Universal for the Class of All Spanning Trees
scientific article; zbMATH DE number 6144820

    Statements

    Expanders Are Universal for the Class of All Spanning Trees (English)
    0 references
    0 references
    0 references
    0 references
    14 March 2013
    0 references
    \(\mathcal{F}\)-universal graph
    0 references
    random regular graph
    0 references
    0 references
    0 references

    Identifiers

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