The extremal number of edges in n-vertex r-uniform hypergraphs without a (k+1)-connected subgraph is determined asymptotically for r ≥ 3, with tight bounds when connected components are bounded by Ck vertices.
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
-
Hypergraphs without Subgraphs of Given Connectivity
The extremal number of edges in n-vertex r-uniform hypergraphs without a (k+1)-connected subgraph is determined asymptotically for r ≥ 3, with tight bounds when connected components are bounded by Ck vertices.