A local spectral radius condition on the link graphs of a large 3-uniform hypergraph guarantees a perfect matching, and a related tight bound guarantees a fractional matching of given size.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
A local spectral condition for perfect matchings in 3-graphs
A local spectral radius condition on the link graphs of a large 3-uniform hypergraph guarantees a perfect matching, and a related tight bound guarantees a fractional matching of given size.