The regularity lemma and its applications in graph theory
Theoretical aspects of computer science
The Regularity Lemma and Its Applications in Graph Theory
Theoretical Aspects of Computer Science, Advanced Lectures [First Summer School on Theoretical Aspects of Computer Science, Tehran, Iran, July 2000]
Regular pairs in sparse random graphs I
Random Structures & Algorithms
Turán's theorem in sparse random graphs
Random Structures & Algorithms
The Turán Theorem for Random Graphs
Combinatorics, Probability and Computing
K5-free subgraphs of random graphs
Random Structures & Algorithms
On Cover Graphs and Dependent Arcs in Acyclic Orientations
Combinatorics, Probability and Computing
Small subsets inherit sparse ε-regularity
Journal of Combinatorial Theory Series B
Resilient Pancyclicity of Random and Pseudorandom Graphs
SIAM Journal on Discrete Mathematics
Almost All $C_4$-Free Graphs Have Fewer than $(1-\varepsilon)\,\mathrm{ex}(n,C_4)$ Edges
SIAM Journal on Discrete Mathematics
Dirac's theorem for random graphs
Random Structures & Algorithms
| Hi-index | 0.00 |