The extremal number ex(n, {M^r_{s+1}, K_{ℓ+1}^{(r)+}}) is determined exactly for s small or sufficiently large, via a new rainbow hyper-Turán result for clique expansions.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
fields
math.CO 2verdicts
UNVERDICTED 2roles
background 1polarities
background 1representative citing papers
Survey compiling sufficient conditions for transversal m-edge structures in graph systems that extend classical extremal graph theory results, plus conjectures.
citing papers explorer
-
Hypergraph extensions of the Alon--Frankl Theorem and rainbow Tur\'an problems
The extremal number ex(n, {M^r_{s+1}, K_{ℓ+1}^{(r)+}}) is determined exactly for s small or sufficiently large, via a new rainbow hyper-Turán result for clique expansions.
-
Transversal Structures in Graph Systems: A Survey
Survey compiling sufficient conditions for transversal m-edge structures in graph systems that extend classical extremal graph theory results, plus conjectures.