Hypergraph matchings and designs
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.
Main Author: | Keevash, P |
---|---|
Format: | Conference item |
Language: | English |
Published: |
World Scientific Publishing
2019
|
Similar Items
-
A Geometric Theory for Hypergraph Matching
by: Keevash, P, et al.
Published: (2011) -
A hypergraph blow-up lemma
by: Keevash, P
Published: (2010) -
Rainbow factors in hypergraphs
by: Coulson, M, et al.
Published: (2018) -
Matchings and Hamilton cycles in hypergraphs
by: Daniela Kühn, et al.
Published: (2005-01-01) -
Hypergraph convolution and hypergraph attention
by: Bai, S, et al.
Published: (2020)