U_t(n,r) is asymptotically determined up to lower-order terms for almost all t,r >=3.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
math.CO 2years
2026 2verdicts
UNVERDICTED 2representative citing papers
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.
citing papers explorer
-
Sharp bounds for uniform union-free hypergraphs
U_t(n,r) is asymptotically determined up to lower-order terms for almost all t,r >=3.
-
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.