1 citations · 1 across the 3 of their papers we have counts for
1 paper · 1 filter
Yulin Chang, Jie Han, Yoshiharu Kohayakawa +2
We determine, up to a multiplicative constant, the optimal number of random edges that need to be added to a k-graph H with minimum vertex degree Ω(nk−1) to ensure an F-…