Perfect packings in quasirandom hypergraphs. I.
DOI10.1016/J.JCTB.2016.02.001zbMATH Open1334.05095OpenAlexW2963453898MaRDI QIDQ273176FDOQ273176
Authors: John Lenz, Dhruv Mubayi 
Publication date: 21 April 2016
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jctb.2016.02.001
Recommendations
- Perfect Packings in Quasirandom Hypergraphs II
- Packing perfect matchings in random hypergraphs
- Packing random graphs and hypergraphs
- On perfect packings in dense graphs
- The complexity of perfect matchings and packings in dense hypergraphs
- Integer and fractional packings of hypergraphs
- scientific article; zbMATH DE number 5665909
- scientific article; zbMATH DE number 1300357
- Random packings of graphs
- A note on packing of uniform hypergraphs
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- \(H\)-factors in dense graphs
- The minimum degree threshold for perfect graph packings
- \(F\)-factors in hypergraphs via absorption
- Title not available (Why is that?)
- Title not available (Why is that?)
- Proof of the Alon-Yuster conjecture
- The probabilistic method. With an appendix on the life and work of Paul Erdős.
- Title not available (Why is that?)
- Quasi-random graphs
- Matchings in regular graphs from eigenvalues
- Perfect matchings and \(K_4^3\)-tilings in hypergraphs of large codegree
- Perfect matchings in large uniform hypergraphs with large minimum collective degree
- Blow-up lemma
- Some graphs with small second eigenvalue
- On the second eigenvalue of hypergraphs
- Minimum codegree threshold for \((K^3_4-e)\)-factors
- Matchings in 3-uniform hypergraphs
- Exact minimum degree thresholds for perfect matchings in uniform hypergraphs. II
- Minimum vertex degree threshold for loose Hamilton cycles in 3-uniform hypergraphs
- Eigenvalues of non-regular linear quasirandom hypergraphs
- Perfect matchings in 3-uniform hypergraphs with large vertex degree
- Tiling 3-uniform hypergraphs with \(K_4^3-2e\)
- On perfect matchings in uniform hypergraphs with large minimum vertex degree
- Title not available (Why is that?)
- Exact minimum degree thresholds for perfect matchings in uniform hypergraphs
- The poset of hypergraph quasirandomness
- Eigenvalues and linear quasirandom hypergraphs
- A geometric theory for hypergraph matching
- Perfect matchings (and Hamilton cycles) in hypergraphs with large degrees
- Loose Hamilton cycles in 3-uniform hypergraphs of high minimum degree
- Perfect matchings in 4-uniform hypergraphs
- Weak hypergraph regularity and linear hypergraphs
Cited In (13)
- Packing \(k\)-partite \(k\)-uniform hypergraphs
- Packing perfect matchings in random hypergraphs
- Decompositions of quasirandom hypergraphs into hypergraphs of bounded degree
- Packing random graphs and hypergraphs
- Perfect Packings in Quasirandom Hypergraphs II
- Weak hypergraph regularity and linear hypergraphs
- Embedding tetrahedra into quasirandom hypergraphs
- Factors and loose Hamilton cycles in sparse pseudo‐random hypergraphs
- Pseudorandom hypergraph matchings
- Tiling multipartite hypergraphs in quasi-random hypergraphs
- Hamilton cycles in quasirandom hypergraphs
- Perfect Packings in Quasirandom Hypergraphs
- F$F$‐factors in Quasi‐random Hypergraphs
This page was built for publication: Perfect packings in quasirandom hypergraphs. I.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q273176)
