Exact bounds are established for the Erdős matching problem and t-intersection problem in non-trivial r-partite r-graphs when n is large, with full resolution for t=1 and t=r-2.
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
-
Matching and intersection problems for non-trivial $r$-partite $r$-uniform hypergraphs
Exact bounds are established for the Erdős matching problem and t-intersection problem in non-trivial r-partite r-graphs when n is large, with full resolution for t=1 and t=r-2.