Hypergraph matchings and designs

2018/07/16 by Keevash, Peter · 1 citation
#Combinatorics (math.CO) #FOS: Mathematics

paper · doi:10.48550/arxiv.1807.05752

Abstract

We survey some aspects of the perfect matching problem in hypergraphs, with particular emphasis on structural characterisation of the existence problem in dense hypergraphs and the existence of designs.

Cited by

• Erdős meets Nash-Williams

Related

• Finding Perfect Matchings in Bipartite Hypergraphs
• Decision problem for Perfect Matchings in Dense k-uniform Hypergraphs
• Near perfect matchings in uniform hypergraphs
• Colour-bias perfect matchings in hypergraphs
• Perfect Matchings in Hypergraphs and the Erdős matching conjecture