Work

Matching Stability for 3‐Partite 3‐Uniform Hypergraphs

Year: 2026

Type: article

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.

Source: Journal of Graph Theory

DOI: 10.1002/jgt.70089

Authors: Hongliang Lu, Xinxin Ma

Institution: Xi'an Jiaotong University

Language: English

Topic: Limits and Structures in Graph Theory

Subfield: Discrete Mathematics and Combinatorics

Field: Mathematics

Domain: Physical Sciences

Open Access status: green

Funders: National Natural Science Foundation of China, National Key Research and Development Program of China

Awards: G143388334, G6216466512