For large vertex sets, the paper determines the exact maximum of the (t,p)-norm and its unique extremal hypergraph in three classical settings: bounded matching number, k-intersecting families, and hypergraphs avoiding linear paths.
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
ACCEPT 1representative citing papers
citing papers explorer
-
The $(t,p)$-Norm in Classical Extremal Problems
For large vertex sets, the paper determines the exact maximum of the (t,p)-norm and its unique extremal hypergraph in three classical settings: bounded matching number, k-intersecting families, and hypergraphs avoiding linear paths.