Exact minimum degree thresholds for perfect matchings in uniform hypergraphs. II
From MaRDI portal
Publication:2349181
Abstract: Given positive integers kgeq 3 and r where k/2 leq r leq k-1, we give a minimum r-degree condition that ensures a perfect matching in a k-uniform hypergraph. This condition is best possible and improves on work of Pikhurko who gave an asymptotically exact result. Our approach makes use of the absorbing method, and builds on work in 'Exact minimum degree thresholds for perfect matchings in uniform hypergraphs', where we proved the result for k divisible by 4.
Recommendations
- Exact minimum degree thresholds for perfect matchings in uniform hypergraphs
- Tight minimum degree conditions forcing perfect matchings in uniform hypergraphs
- A note on perfect matchings in uniform hypergraphs
- Perfect matchings in uniform hypergraphs with large minimum degree
- On perfect matchings in uniform hypergraphs with large minimum vertex degree
Cited in
(42)- Some Ore-type results for matching and perfect matching in \(k\)-uniform hypergraphs
- Vertex degree sums for perfect matchings in 3-uniform hypergraphs
- \(d\)-matching in 3-uniform hypergraphs
- Matching in 3-uniform hypergraphs
- Rainbow matchings for 3-uniform hypergraphs
- Minimum degree thresholds for Hamilton \((k/2)\)-cycles in \(k\)-uniform hypergraphs
- A note on minimum degree condition for Hamilton (a,b)-cycles in hypergraphs
- A note on exact minimum degree threshold for fractional perfect matchings
- The Erdős matching conjecture and concentration inequalities
- The complexity of perfect matchings and packings in dense hypergraphs
- Vertex degree sums for matchings in 3-uniform hypergraphs
- Minimum vertex degree threshold for loose Hamilton cycles in 3-uniform hypergraphs
- Perfect packings in quasirandom hypergraphs. I.
- Decision problem for perfect matchings in dense k-uniform hypergraphs
- Perfect matchings in hypergraphs and the Erdős matching conjecture
- Near Perfect Matchings in ${k}$-Uniform Hypergraphs II
- On perfect matchings in uniform hypergraphs with large minimum vertex degree
- scientific article; zbMATH DE number 5720905 (Why is no real title available?)
- On vertex independence number of uniform hypergraphs
- Perfect matchings in 3-partite 3-uniform hypergraphs
- Exact minimum degree thresholds for perfect matchings in uniform hypergraphs
- Almost perfect matchings in \(k\)-partite \(k\)-graphs
- On perfect matchings and tilings in uniform hypergraphs
- Polynomial-time perfect matchings in dense hypergraphs
- Nearly perfect matchings in uniform hypergraphs
- Matching of given sizes in hypergraphs
- Rainbow perfect matchings for 4-uniform hypergraphs
- Minimum vertex degree thresholds for tiling complete 3-partite 3-graphs
- Minimum vertex degree threshold for \(\mathcal{C}_4^3\)-tiling
- Forbidding Hamilton cycles in uniform hypergraphs
- Near perfect matchings in \(k\)-uniform hypergraphs
- Perfect Packings in Quasirandom Hypergraphs II
- Minimum codegree threshold for \(C_6^3\)-factors in 3-uniform hypergraphs
- Tight minimum degree conditions forcing perfect matchings in uniform hypergraphs
- Co-degree threshold for rainbow perfect matchings in uniform hypergraphs
- Improved bound on vertex degree version of Erdős matching conjecture
- Perfect matchings (and Hamilton cycles) in hypergraphs with large degrees
- Vertex degree sums for matchings in 3-uniform hypergraphs
- A note on color-bias perfect matchings in hypergraphs
- Vertex degree sums for perfect matchings in 3-uniform hypergraphs
- Packing k-partite k-uniform hypergraphs
- A note on perfect matchings in uniform hypergraphs
This page was built for publication: Exact minimum degree thresholds for perfect matchings in uniform hypergraphs. II
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2349181)
