Perfect matchings in 3-partite 3-uniform hypergraphs
From MaRDI portal
Publication:406558
DOI10.1016/j.jcta.2014.05.004zbMath1300.05200arXiv1103.5654OpenAlexW2027878806MaRDI QIDQ406558
Publication date: 8 September 2014
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1103.5654
Extremal problems in graph theory (05C35) Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex degrees (05C07)
Related Items
Packing \(k\)-partite \(k\)-uniform hypergraphs ⋮ Perfect matchings in 4-uniform hypergraphs ⋮ Permanents of multidimensional matrices: Properties and applications ⋮ Exact minimum degree thresholds for perfect matchings in uniform hypergraphs ⋮ Polynomial-time perfect matchings in dense hypergraphs ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ On the numbers of 1-factors and 1-factorizations of hypergraphs ⋮ Note on matchings in 3-partite 3-uniform hypergraphs ⋮ Cyclic triangle factors in regular tournaments ⋮ From one to many rainbow Hamiltonian cycles
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Large matchings in uniform hypergraphs and the conjectures of Erdős and samuels
- Tight co-degree condition for perfect matchings in 4-graphs
- Exact minimum degree thresholds for perfect matchings in uniform hypergraphs
- Perfect matchings (and Hamilton cycles) in hypergraphs with large degrees
- Perfect matchings in 4-uniform hypergraphs
- Perfect matchings and \(K_4^3\)-tilings in hypergraphs of large codegree
- Perfect matchings in large uniform hypergraphs with large minimum collective degree
- Matchings in 3-uniform hypergraphs
- Exact minimum degree thresholds for perfect matchings in uniform hypergraphs. II
- On extremal problems of graphs and generalized graphs
- Perfect matchings in \(r\)-partite \(r\)-graphs
- Perfect Matchings in 3-Uniform Hypergraphs with Large Vertex Degree
- On Perfect Matchings in Uniform Hypergraphs with Large Minimum Vertex Degree
- Degrees giving independent edges in a hypergraph
- SETS OF INDEPENDENT EDGES OF A HYPERGRAPH
- Matchings in hypergraphs of large minimum degree
- The Factorization of Linear Graphs
- Some Theorems on Abstract Graphs
