For every strictly k-balanced k-uniform hypergraph F and dense pseudorandom starting hypergraph, the random F-removal process leaves n^{k-1/rho +/- o(1)} edges with high probability.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2024 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
The hypergraph removal process
For every strictly k-balanced k-uniform hypergraph F and dense pseudorandom starting hypergraph, the random F-removal process leaves n^{k-1/rho +/- o(1)} edges with high probability.