Hypergraph matchings and designs
classification
🧮 math.CO
keywords
designsexistencehypergraphsproblemaspectscharacterisationdenseemphasis
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.