For any strictly 1-balanced k-graph F, k-graph systems above the transversal Dirac threshold with high probability contain a transversal F-factor after independent random sparsification at p = Ω(n^{-1/d1(F)-1} (log n)^{1/t}).
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2025 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
Transversal packings in families of percolated hypergraphs
For any strictly 1-balanced k-graph F, k-graph systems above the transversal Dirac threshold with high probability contain a transversal F-factor after independent random sparsification at p = Ω(n^{-1/d1(F)-1} (log n)^{1/t}).