Perfect packings in quasirandom hypergraphs. I.
From MaRDI portal
Publication:273176
DOI10.1016/J.JCTB.2016.02.001zbMath1334.05095OpenAlexW2963453898MaRDI QIDQ273176
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
Hypergraphs (05C65) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (6)
Factors and loose Hamilton cycles in sparse pseudo‐random hypergraphs ⋮ F$F$‐factors in Quasi‐random Hypergraphs ⋮ Tiling multipartite hypergraphs in quasi-random hypergraphs ⋮ Perfect Packings in Quasirandom Hypergraphs II ⋮ Hamilton cycles in quasirandom hypergraphs ⋮ Pseudorandom hypergraph matchings
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Exact minimum degree thresholds for perfect matchings in uniform hypergraphs
- 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
- 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
- \(H\)-factors in dense graphs
- Minimum codegree threshold for \((K^3_4-e)\)-factors
- Matchings in 3-uniform hypergraphs
- The minimum degree threshold for perfect graph packings
- \(F\)-factors in hypergraphs via absorption
- 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
- Fractional and integer matchings in uniform hypergraphs
- Perfect Matchings in 3-Uniform Hypergraphs with Large Vertex Degree
- Tiling 3-Uniform Hypergraphs With K43−2e
- On Perfect Matchings in Uniform Hypergraphs with Large Minimum Vertex Degree
- The poset of hypergraph quasirandomness
- EIGENVALUES AND LINEAR QUASIRANDOM HYPERGRAPHS
- A geometric theory for hypergraph matching
- Quasi-random graphs
- Proof of the Alon-Yuster conjecture
This page was built for publication: Perfect packings in quasirandom hypergraphs. I.
