Matchings in hypergraphs of large minimum degree

Recommendations

On matchings in hypergraphs
Perfect matchings in uniform hypergraphs with large minimum degree
On perfect matchings in uniform hypergraphs with large minimum vertex degree
Matching of given sizes in hypergraphs
Perfect matchings in large uniform hypergraphs with large minimum collective degree
Matchings in 3-uniform hypergraphs of large minimum vertex degree
Matchings in hypergraphs and Castelnuovo-Mumford regularity
Perfect matchings (and Hamilton cycles) in hypergraphs with large degrees
Matchings and covers in hypergraphs
On the matching polynomial of hypergraphs

Cited in

(62)

Perfect matchings and K₄^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
Covering and tiling hypergraphs with tight cycles
$d$-matching in 3-uniform hypergraphs
Extremal hypergraphs for matching number and domination number
Hamilton cycles in hypergraphs below the Dirac threshold
Large 2-coloured matchings in 3-coloured complete hypergraphs
Matching in 3-uniform hypergraphs
Perfect matching in $k$-partite $k$-graphs and 3-uniform HM-bipartite hypergraphs
Tight bounds for powers of Hamilton cycles in tournaments
The complexity of perfect matchings and packings in dense hypergraphs
Co-degrees resilience for perfect matchings in random hypergraphs
Vertex degree sums for matchings in 3-uniform hypergraphs
$F$-factors in hypergraphs via absorption
Families of triples with high minimum degree are Hamiltonian
Perfect matchings in $r$-partite $r$-graphs
Co-degree density of hypergraphs
An approximation result for matchings in partitioned hypergraphs
Matchings in 3-uniform hypergraphs of large minimum vertex degree
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
Santa claus meets hypergraph matchings
Embedding Graphs into Larger Graphs: Results, Methods, and Problems
Santa Claus Meets Hypergraph Matchings
Perfect matchings in 3-partite 3-uniform hypergraphs
Exact minimum degree thresholds for perfect matchings in uniform hypergraphs
$d$-matching in $k$-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
A stability theorem for matchings in tripartite 3-graphs
Nearly perfect matchings in uniform hypergraphs
Pseudorandom hypergraph matchings
Covering and tiling hypergraphs with tight cycles
Matching of given sizes in hypergraphs
On the Size of Matchings in 1-Planar Graph with High Minimum Degree
Note on matchings in 3-partite 3-uniform hypergraphs
A generalization of Hall's theorem for $k$-uniform $k$-partite hypergraphs
Matching criticality in intersecting hypergraphs
Near perfect matchings in $k$-uniform hypergraphs
Tight minimum degree conditions forcing perfect matchings in uniform hypergraphs
A geometric theory for hypergraph matching
Counting Hamilton cycles in Dirac hypergraphs
Matching cut in graphs with large minimum degree
Co-degree threshold for rainbow perfect matchings in uniform hypergraphs
Some remarks on hypergraph matching and the Füredi–Kahn–Seymour 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
Tight Hamilton cycles with high discrepancy
Vertex degree sums for perfect matchings in 3-uniform hypergraphs
Matchings in multipartite hypergraphs
Codegree conditions for (fractional) Steiner triple systems
Positive codegree thresholds for perfect matchings in hypergraphs
Perfect matchings in uniform hypergraphs with large minimum degree
Loose Hamilton cycles in 3-uniform hypergraphs of high minimum degree
Perfect matchings in 4-uniform hypergraphs
A note on perfect matchings in uniform hypergraphs
Dirac-type results for loose Hamilton cycles in uniform hypergraphs

This page was built for publication: Matchings in hypergraphs of large minimum degree

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5469026)