Year: 2011
Type: preprint
Abstract: Let $H$ be a $3$-partite $3$-uniform hypergraph, i.e. a $3$-uniform hypergraph such that every edge intersects every partition class in exactly one vertex, with each partition class of size $n$. We determine a Dirac-type vertex degree threshold for perfect matchings in $3$-partite $3$-uniform hypergraphs.
Source: arXiv (Cornell University)
Authors: Lo, Allan, Markström, Klas
Institutions: University of Birmingham, Umeå University
Language: English
Subfield: Discrete Mathematics and Combinatorics
Field: Mathematics
Domain: Physical Sciences
Open Access status: green
Funder: European Commission
Awards: G3207356259, G896728979
OpenAlex ID: W2950195478