Exact values for non-trivial t-intersection in symmetric [n]^r (enlarging Frankl-Nie conjecture with Ahlswede-Khachatrian terms for small n) and a downset reduction for m0(1,n1,...,nr) in asymmetric products giving formulas for r=4,5,6.
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
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.
citing papers explorer
-
Non-trivial Intersection Problems for Multi-part Hypergraphs
Exact values for non-trivial t-intersection in symmetric [n]^r (enlarging Frankl-Nie conjecture with Ahlswede-Khachatrian terms for small n) and a downset reduction for m0(1,n1,...,nr) in asymmetric products giving formulas for r=4,5,6.
-
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.