Matching Stability for 3‐Partite 3‐Uniform Hypergraphs
Abstract
ABSTRACT Let be three integers such that and . Let be a ‐partite ‐uniform hypergraph with vertices in each class. Aharoni (2017) showed that if , then has a matching of size . In this paper, we give a stability result for 3‐partite 3‐uniform hypergraphs: if is a 3‐partite 3‐uniform hypergraph with vertices in each class, and contains no matching of size , then has a vertex cover of size . Our bound is also tight.
Fields of Study & Subjects
Cooperative Communication and Network Coding
Publication details
- Journal / source
- Journal of Graph Theory
- Publication date
- 19 June 2026
- Language
- EN