Findings reveal extremal numbers linked to generalized Turán numbers in hypergraphs, indicating broader implications.
An abstract simplicial complex F is a non-uniform hypergraph without isolated vertices, whose edge set is closed under taking subsets. The extremal number ex(n,F) is the maximum number of edges in an F-free simplicial complex on n vertices. This extremal number is naturally related to the generalised Turán numbers of certain underlying hypergraphs. Making progress in a problem raised by Conlon, Piga, and Schülke, we find large classes of simplicial complexes whose extremal numbers are determined by the respective generalised hypergraph Turán numbers. We also provide simplicial complexes for which such a relation does not hold.
No takes yet. Share an insight, caveat, or question.
Axenovich et al. (2025) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: