A note on perfect matchings in uniform hypergraphs
From MaRDI portal
Publication:907268
zbMath1329.05247arXiv1503.03357MaRDI QIDQ907268
Publication date: 25 January 2016
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1503.03357
Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (14)
Matching of Given Sizes in Hypergraphs ⋮ Some Ore-type results for matching and perfect matching in \(k\)-uniform hypergraphs ⋮ Perfect Matchings in Hypergraphs and the Erdös Matching Conjecture ⋮ Near Perfect Matchings in ${k}$-Uniform Hypergraphs II ⋮ The Erdős matching conjecture and concentration inequalities ⋮ Vertex degree sums for perfect matchings in 3-uniform hypergraphs ⋮ \(d\)-matching in 3-uniform hypergraphs ⋮ Minimum Codegree Threshold forC63-Factors in 3-Uniform Hypergraphs ⋮ On Perfect Matchings and Tilings in Uniform Hypergraphs ⋮ Minimum vertex degree thresholds for tiling complete 3-partite 3-graphs ⋮ Matching in 3-uniform hypergraphs ⋮ Perfect matching in \(k\)-partite \(k\)-graphs and 3-uniform HM-bipartite hypergraphs ⋮ The complexity of perfect matchings and packings in dense hypergraphs ⋮ Vertex degree sums for matchings in 3-uniform hypergraphs
Cites Work
- 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 uniform hypergraphs with large minimum degree
- 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
- \(F\)-factors in hypergraphs via absorption
- Exact minimum degree thresholds for perfect matchings in uniform hypergraphs. II
- Fractional and integer matchings in uniform hypergraphs
- Perfect Matchings in 3-Uniform Hypergraphs with Large Vertex Degree
- Perfect Matchings in Hypergraphs and the Erdös Matching Conjecture
- On Perfect Matchings in Uniform Hypergraphs with Large Minimum Vertex Degree
- Embedding large subgraphs into dense graphs
- Near Perfect Matchings ink-Uniform Hypergraphs
- Matchings in hypergraphs of large minimum degree
- A geometric theory for hypergraph matching
This page was built for publication: A note on perfect matchings in uniform hypergraphs
