Regular pairs in sparse random graphs I
Random Structures & Algorithms
The Turán Theorem for Random Graphs
Combinatorics, Probability and Computing
K5-free subgraphs of random graphs
Random Structures & Algorithms
Small subsets inherit sparse ε-regularity
Journal of Combinatorial Theory Series B
Turán's theorem for pseudo-random graphs
Journal of Combinatorial Theory Series A
The fine structure of octahedron-free graphs
Journal of Combinatorial Theory Series B
Almost All $C_4$-Free Graphs Have Fewer than $(1-\varepsilon)\,\mathrm{ex}(n,C_4)$ Edges
SIAM Journal on Discrete Mathematics
The maximum size of a Sidon set contained in a sparse random set of integers
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Hi-index | 0.05 |