Vertex degree sums for matchings in 3-uniform hypergraphs

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
On the maximum number of edges in a hypergraph with given matching number
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
Vertex degree sums for perfect matchings in 3-uniform hypergraphs
\(d\)-matching in 3-uniform hypergraphs
Matchings in 3-uniform hypergraphs
Matching in 3-uniform hypergraphs
Vertex degree sums for matchings in 3-uniform hypergraphs
Exact minimum degree thresholds for perfect matchings in uniform hypergraphs. II
On Erdős' extremal problem on matchings in hypergraphs
An Erdös-Ko-Rado theorem for direct products
Perfect matching and Hamilton cycle decomposition of complete balanced \(( k + 1 )\)-partite \(k\)-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
Note on Hamilton Circuits
On Perfect Matchings in Uniform Hypergraphs with Large Minimum Vertex Degree
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 matchings in 3-uniform hypergraphs