Decompositions of quasirandom hypergraphs into hypergraphs of bounded degree

DOI10.1090/TRAN/8685MaRDI QIDQ5039053zbMATH OpenOpenAlexFDO

Authors Stefan Ehard, Felix Joos

Publication date 12 October 2022

Published in Transactions of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2011.05359

Mathematics Subject Classification ID

Groupoids, semigroupoids, semigroups, groups (viewed as categories) (18B40) 2-categories, bicategories, double categories (18N10) Frobenius induction, Burnside and representation rings (19A22) Homological methods in group theory (20J05)

Recommendations

• Decomposition of large combinatorial structures
• A blow-up lemma for approximate decompositions
• Perfect Packings in Quasirandom Hypergraphs II
• Perfect packings in quasirandom hypergraphs. I.
• Decomposition of large uniform hypergraphs

Cites work

• A blow-up lemma for approximate decompositions
• A hypergraph blow-up lemma
• A proof of Ringel's conjecture
• A sharp threshold for spanning 2-spheres in random 2-complexes
• An approximate version of the tree packing conjecture
• An existence theory for pairwise balanced designs. I: Composition theorems and morphisms
• An existence theory for pairwise balanced designs. II: Structure of PBD- closed sets and the existence conjectures
• An existence theory for pairwise balanced designs. III: Proof of the existence conjectures
• Blow-up lemma
• Counting designs
• Extremal aspects of graph and hypergraph decomposition problems
• Factors and loose Hamilton cycles in sparse pseudo-random hypergraphs
• Hamiltonian decompositions of complete \(k\)-uniform hypergraphs
• Homological connectivity of random 2-complexes
• scientific article; zbMATH DE number 4170917 (Why is no real title available?)
• scientific article; zbMATH DE number 4027516 (Why is no real title available?)
• scientific article; zbMATH DE number 4099367 (Why is no real title available?)
• scientific article; zbMATH DE number 11252 (Why is no real title available?)
• HYPERGRAPH MATCHINGS AND DESIGNS
• On tail probabilities for martingales
• On the phase transition in random simplicial complexes
• Optimal packings of bounded degree trees
• Packing degenerate graphs
• Packing Hamilton cycles in random and pseudo-random hypergraphs
• Packing minor-closed families of graphs into complete graphs
• Packing spanning graphs from separable families
• Packing tight Hamilton cycles in 3-uniform hypergraphs
• Packing tight Hamilton cycles in uniform hypergraphs
• Perfect matchings in \(\varepsilon\)-regular graphs
• Perfect matchings in \(\varepsilon\)-regular graphs and the blow-up lemma
• Perfectly packing graphs with bounded degeneracy and many leaves
• Pseudorandom hypergraph matchings
• Regularity inheritance in pseudorandom graphs
• Resolution of the Oberwolfach problem
• Spanning surfaces in \(3\)-graphs
• Sparse quasi-random graphs
• The edge-coloring of complete hypergraphs. I
• The Existence of Designs via Iterative Absorption: Hypergraph 𝐹-designs for Arbitrary 𝐹
• The generalised Oberwolfach problem

Cited in

(2)

• A Short proof of the blow-up lemma for approximate decompositions
• Dirac-type conditions for spanning bounded-degree hypertrees

This page was built for publication: Decompositions of quasirandom hypergraphs into hypergraphs of bounded degree

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5039053)