Decompositions of quasirandom hypergraphs into hypergraphs of bounded degree

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

20J05: Homological methods in group theory

19A22: Frobenius induction, Burnside and representation rings

18B40: Groupoids, semigroupoids, semigroups, groups (viewed as categories)

18N10: 2-categories, bicategories, double categories

Related Items

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

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
An approximate version of the tree packing conjecture
Packing minor-closed families of graphs into complete graphs
On the phase transition in random simplicial complexes
Hamiltonian decompositions of complete \(k\)-uniform hypergraphs
Homological connectivity of random 2-complexes
An existence theory for pairwise balanced designs. III: Proof of the existence conjectures
On tail probabilities for martingales
The edge-coloring of complete hypergraphs. I
Blow-up lemma
Perfect matchings in \(\varepsilon\)-regular graphs
Counting designs
Sparse quasi-random graphs
Perfect matchings in \(\varepsilon\)-regular graphs and the blow-up lemma
Resolution of the Oberwolfach problem
Spanning surfaces in \(3\)-graphs
A proof of Ringel's conjecture
Optimal packings of bounded degree trees
Packing degenerate graphs
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
Packing spanning graphs from separable families
The generalised Oberwolfach problem
Packing tight Hamilton cycles in 3-uniform hypergraphs
Packing hamilton cycles in random and pseudo-random hypergraphs
Packing Tight Hamilton Cycles in Uniform Hypergraphs
A hypergraph blow-up lemma
A blow-up lemma for approximate decompositions
Pseudorandom hypergraph matchings
Extremal aspects of graph and hypergraph decomposition problems
Regularity inheritance in pseudorandom graphs
HYPERGRAPH MATCHINGS AND DESIGNS
Factors and loose Hamilton cycles in sparse pseudo-random hypergraphs
A sharp threshold for spanning 2‐spheres in random 2‐complexes
The Existence of Designs via Iterative Absorption: Hypergraph 𝐹-designs for Arbitrary 𝐹
Perfectly packing graphs with bounded degeneracy and many leaves