Vertex degree sums for perfect matchings in 3-uniform hypergraphs
From MaRDI portal
Publication:1671670
zbMath1395.05136arXiv1710.04752MaRDI QIDQ1671670
Publication date: 7 September 2018
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1710.04752
Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (3)
Some Ore-type results for matching and perfect matching in \(k\)-uniform hypergraphs ⋮ Vertex degree sums for matchings in 3-uniform hypergraphs ⋮ From one to many rainbow Hamiltonian cycles
Cites Work
- Unnamed Item
- Unnamed Item
- Large matchings in uniform hypergraphs and the conjectures of Erdős and samuels
- Exact minimum degree thresholds for perfect matchings in uniform hypergraphs
- An approximate Ore-type result for tight Hamilton cycles 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
- A note on perfect matchings in uniform hypergraphs
- An approximate Dirac-type theorem for \(k\)-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
- Some Ore-type results for matching and perfect matching in \(k\)-uniform hypergraphs
- \(d\)-matching in 3-uniform hypergraphs
- Matchings in 3-uniform hypergraphs
- 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
- Recent advances on Dirac-type problems for hypergraphs
- 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
- A Rainbow r-Partite Version of the Erdős–Ko–Rado Theorem
- Matchings in hypergraphs of large minimum degree
This page was built for publication: Vertex degree sums for perfect matchings in 3-uniform hypergraphs
