Regularity lemma for k‐uniform hypergraphs V Rödl, J Skokan Random Structures & Algorithms 25 (1), 1-42, 2004 | 330 | 2004 |

Applications of the regularity lemma for uniform hypergraphs V Rödl, J Skokan Random Structures & Algorithms 28 (2), 180-194, 2006 | 125 | 2006 |

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 | 98 | 2002 |

The Ramsey number for hypergraph cycles I PE Haxell, T Łuczak, Y Peng, V Rödl, A Ruciński, M Simonovits, J Skokan Journal of Combinatorial Theory, Series A 113 (1), 67-83, 2006 | 62 | 2006 |

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 | 61 | 2005 |

The 3-colored Ramsey number of odd cycles. Y Kohayakawa, M Simonovits, J Skokan Electron. Notes Discret. Math. 19, 397-402, 2005 | 55 | 2005 |

The 3-colored Ramsey number of even cycles FS Benevides, J Skokan Journal of Combinatorial Theory, Series B 99 (4), 690-708, 2009 | 53 | 2009 |

The Ramsey number for 3-uniform tight hypergraph cycles PE Haxell, T Łuczak, Y Peng, V Rödl, A Ruciński, J Skokan Combinatorics, Probability and Computing 18 (1-2), 165-203, 2009 | 50* | 2009 |

Ramsey-goodness—and otherwise P Allen, G Brightwell, J Skokan Combinatorica 33, 125-160, 2013 | 49 | 2013 |

Bipartite subgraphs and quasi-randomness J Skokan, L Thoma Graphs and Combinatorics 20, 255-262, 2004 | 39 | 2004 |

Asymmetric Ramsey properties of random graphs involving cliques M Marciniszyn, J Skokan, R Spöhel, A Steger Random Structures & Algorithms 34 (4), 419-453, 2009 | 33 | 2009 |

Monochromatic cycles in 2-coloured graphs FS Benevides, T Łuczak, A Scott, J Skokan, M White Combinatorics, Probability and Computing 21 (1-2), 57-87, 2012 | 30 | 2012 |

A random graph model for terrorist transactions TL Mifflin, C Boner, GA Godfrey, J Skokan 2004 IEEE Aerospace Conference Proceedings (IEEE Cat. No. 04TH8720) 5, 3258-3264, 2004 | 28 | 2004 |

Exact Ramsey numbers of odd cycles via nonlinear optimisation M Jenssen, J Skokan arXiv preprint arXiv:1608.05705, 2016 | 26* | 2016 |

On the multi‐colored Ramsey numbers of cycles T Łuczak, M Simonovits, J Skokan Journal of Graph Theory 69 (2), 169-175, 2012 | 25 | 2012 |

The number of hypergraphs without linear cycles J Balogh, B Narayanan, J Skokan Journal of Combinatorial Theory, Series B 134, 309-321, 2019 | 19 | 2019 |

Turán's theorem for pseudo-random graphs Y Kohayakawa, V Rödl, M Schacht, P Sissokho, J Skokan Journal of Combinatorial Theory, Series A 114 (4), 631-657, 2007 | 18 | 2007 |

Counting subgraphs in quasi‐random 4‐uniform hypergraphs V Rödl, J Skokan Random Structures & Algorithms 26 (1‐2), 160-203, 2005 | 16 | 2005 |

Transversal numbers of translates of a convex body SJ Kim, K Nakprasit, MJ Pelsmajer, J Skokan Discrete Mathematics 306 (18), 2166-2173, 2006 | 15 | 2006 |

On the triangle removal lemma for subgraphs of sparse pseudorandom graphs Y Kohayakawa, VĚ RÖdlt, M Schacht, J Skokan An Irregular Mind: Szemerédi is 70, 359-404, 2010 | 14 | 2010 |