Spanning structures and universality in sparse hypergraphs (Q2953700): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Olaf Parczyk / rank
Normal rank
 
Property / author
 
Property / author: Olaf Parczyk / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2311465632 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1504.02243 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight Hamilton cycles in random hypergraphs / 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: Spanning subgraphs of random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Embedding nearly-spanning bounded degree trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Threshold functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Isometric embeddings into cube-hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Almost‐spanning universality in random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universality of Random Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved upper bound on the density of universal random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Loose Hamilton cycles in random uniform hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight Hamilton cycles in random uniform hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate counting of regular hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the existence of a factor of degree one of a connected random graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Closing gaps in problems related to Hamilton cycles in random graphs and hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universality of random graphs and rainbow embedding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Loose Hamilton cycles in random 3-uniform hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introduction to Random 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: Expanders Are Universal for the Class of All Spanning Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factors in random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Thresholds and Expectation Thresholds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cycle Factors and Renewal Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: The threshold for combs in random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universality of Random Graphs for Graphs of Maximum Degree Two / rank
 
Normal rank
Property / cites work
 
Property / cites work: Embedding Spanning Trees in Random Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Pósa's Conjecture for Random Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonian circuits in random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanning Subgraphs of Random Graphs / rank
 
Normal rank

Latest revision as of 07:00, 13 July 2024

scientific article
Language Label Description Also known as
English
Spanning structures and universality in sparse hypergraphs
scientific article

    Statements

    Spanning structures and universality in sparse hypergraphs (English)
    0 references
    0 references
    0 references
    0 references
    5 January 2017
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    random hypergraphs
    0 references
    spanning structures
    0 references
    thresholds
    0 references
    universality
    0 references
    0 references
    0 references
    0 references