The maximum number of copies of any hypergraph H in Berge-K_k-free r-graphs is achieved by the balanced complete (k-1)-partite r-graph for all sufficiently large k, with related bounds connecting hypergraph and graph cases.
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
The paper computes the exact Turán number ex(n, F5(f3;t)) for the blow-up of f3 in F5 and shows exponentially many extremal constructions, plus general bounds and exact values for other blow-ups including F_sim(t).
citing papers explorer
-
Generalized Tur\'an problems for Berge hypergraphs
The maximum number of copies of any hypergraph H in Berge-K_k-free r-graphs is achieved by the balanced complete (k-1)-partite r-graph for all sufficiently large k, with related bounds connecting hypergraph and graph cases.
-
On the Tur\'an number of blow-ups of $\mathcal{F}_5$
The paper computes the exact Turán number ex(n, F5(f3;t)) for the blow-up of f3 in F5 and shows exponentially many extremal constructions, plus general bounds and exact values for other blow-ups including F_sim(t).