Decompositions of quasirandom hypergraphs into hypergraphs of bounded degree (Q5039053): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Perfectly packing graphs with bounded degeneracy and many leaves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing degenerate graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regularity inheritance in pseudorandom graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect matchings in \(\varepsilon\)-regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonian decompositions of complete \(k\)-uniform hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing Tight Hamilton Cycles in Uniform Hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The edge-coloring of complete hypergraphs. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approximate version of the tree packing conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse quasi-random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pseudorandom hypergraph matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3974207 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing spanning graphs from separable families / rank
 
Normal rank
Property / cites work
 
Property / cites work: On tail probabilities for martingales / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing hamilton cycles in random and pseudo-random hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing tight Hamilton cycles in 3-uniform hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanning surfaces in \(3\)-graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resolution of the Oberwolfach problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Existence of Designs via Iterative Absorption: Hypergraph 𝐹-designs for Arbitrary 𝐹 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extremal aspects of graph and hypergraph decomposition problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factors and loose Hamilton cycles in sparse pseudo-random hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal packings of bounded degree trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hypergraph blow-up lemma / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting designs / rank
 
Normal rank
Property / cites work
 
Property / cites work: HYPERGRAPH MATCHINGS AND DESIGNS / rank
 
Normal rank
Property / cites work
 
Property / cites work: The generalised Oberwolfach problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A blow-up lemma for approximate decompositions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Blow-up lemma / rank
 
Normal rank
Property / cites work
 
Property / cites work: Homological connectivity of random 2-complexes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the phase transition in random simplicial complexes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sharp threshold for spanning 2‐spheres in random 2‐complexes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3496342 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing minor-closed families of graphs into complete graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A proof of Ringel's conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect matchings in \(\varepsilon\)-regular graphs and the blow-up lemma / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3768936 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3825110 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An existence theory for pairwise balanced designs. I: Composition theorems and morphisms / rank
 
Normal rank
Property / cites work
 
Property / cites work: An existence theory for pairwise balanced designs. II: Structure of PBD- closed sets and the existence conjectures / rank
 
Normal rank
Property / cites work
 
Property / cites work: An existence theory for pairwise balanced designs. III: Proof of the existence conjectures / rank
 
Normal rank

Latest revision as of 09:51, 30 July 2024

scientific article; zbMATH DE number 7599878
Language Label Description Also known as
English
Decompositions of quasirandom hypergraphs into hypergraphs of bounded degree
scientific article; zbMATH DE number 7599878

    Statements

    Decompositions of quasirandom hypergraphs into hypergraphs of bounded degree (English)
    0 references
    0 references
    0 references
    0 references
    12 October 2022
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references