Szemerédi’s regularity lemma for sparse graphs Y Kohayakawa Foundations of Computational Mathematics: Selected Papers of a Conference …, 1997 | 229 | 1997 |

Limits of permutation sequences C Hoppen, Y Kohayakawa, CG Moreira, B Ráth, RM Sampaio Journal of Combinatorial Theory, Series B 103 (1), 93-113, 2013 | 164 | 2013 |

On K 4-free subgraphs of random graphs Y Kohayakawa, T Łuczak, V Rödl Combinatorica 17 (2), 173-213, 1997 | 162 | 1997 |

Szemerédi’s regularity lemma and quasi-randomness Y Kohayakawa, V Rödl Recent advances in algorithms and combinatorics, 289-351, 2003 | 128 | 2003 |

The induced size-Ramsey number of cycles PE Haxell, Y Kohayakawa, T Łuczak Combinatorics, Probability and Computing 4 (3), 217-239, 1995 | 128 | 1995 |

Arithmetic progressions of length three in subsets of a random set Y Kohayakawa, T Łuczak, V Rödl Acta Arithmetica 75 (2), 133-163, 1996 | 118 | 1996 |

Hypergraphs, quasi-randomness, and conditions for regularity Y Kohayakawa, V Rödl, J Skokan Journal of Combinatorial Theory, Series A 97 (2), 307-352, 2002 | 112 | 2002 |

Uma introduçăo sucinta ŕ teoria dos grafos P Feofiloff, Y Kohayakawa, Y Wakabayashi | 103 | 2011 |

The evolution of random subgraphs of the cube B Bollobás, Y Kohayakawa, T Łuczak Random Structures & Algorithms 3 (1), 55-90, 1992 | 103 | 1992 |

Weak hypergraph regularity and linear hypergraphs Y Kohayakawa, B Nagle, V Rödl, M Schacht Journal of Combinatorial Theory, Series B 100 (2), 151-160, 2010 | 93 | 2010 |

Measures of pseudorandomness for finite sequences: typical values N Alon, Y Kohayakawa, C Mauduit, CG Moreira, V Rödl Proceedings of the London Mathematical Society 95 (3), 778-812, 2007 | 91 | 2007 |

Threshold functions for asymmetric Ramsey properties involving cycles Y Kohayakawa, B Kreuter Random Structures & Algorithms 11 (3), 245-276, 1997 | 86 | 1997 |

Universality and tolerance N Alon, M Capalbo, Y Kohayakawa, V Rodl, A Rucinski, E Szemerédi Proceedings 41st Annual Symposium on Foundations of Computer Science, 14-21, 2000 | 83 | 2000 |

Turán′ s Extremal Problem in Random Graphs: Forbidding Even Cycles PE Haxell, Y Kohayakawa, T Luczak Journal of Combinatorial Theory, Series B 64 (2), 273-287, 1995 | 80 | 1995 |

Finding skew partitions efficiently CMH de Figueiredo, S Klein, Y Kohayakawa, BA Reed Journal of Algorithms 37 (2), 505-521, 2000 | 73 | 2000 |

An extremal problem for random graphs and the number of graphs with large even-girth Y Kohayakawa, B Kreuter, A Steger Combinatorica 18, 101-120, 1998 | 73 | 1998 |

Ramsey games against a one-armed bandit E Friedgut, Y Kohayakawa, V Rodl, A Rucinski, P Tetali Combinatorics, Probability and Computing 12 (5-6), 515-545, 2003 | 71 | 2003 |

The hypergraph regularity method and its applications V Rödl, B Nagle, J Skokan, M Schacht, Y Kohayakawa Proceedings of the National Academy of Sciences 102 (23), 8109-8113, 2005 | 70 | 2005 |

Regular pairs in sparse random graphs I Y Kohayakawa, V Rödl Random Structures & Algorithms 22 (4), 359-434, 2003 | 70 | 2003 |

Small subsets inherit sparse ε-regularity S Gerke, Y Kohayakawa, V Rödl, A Steger Journal of Combinatorial Theory, Series B 97 (1), 34-56, 2007 | 67 | 2007 |