The trace Turán number ex_r(n, Tr_r(M_{s+1})) admits an asymptotically tight upper bound, with exact determination for r=3, and analogous sharp bounds hold for the generalized clique-counting version.
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
-
Forbidding matching as trace in uniform hypergraphs
The trace Turán number ex_r(n, Tr_r(M_{s+1})) admits an asymptotically tight upper bound, with exact determination for r=3, and analogous sharp bounds hold for the generalized clique-counting version.