Perfect Matchings and *K*_{4}^{3}-Tilings in Hypergraphs of Large CodegreeO Pikhurko Graphs and Combinatorics 24 (4), 391-404, 2008 | 86 | 2008 |

Quasirandom permutations are characterized by 4-point densities D Král’, O Pikhurko Geometric and Functional Analysis 23 (2), 570-579, 2013 | 83 | 2013 |

A note on the Turán function of even cycles O Pikhurko Proceedings of the American Mathematical Society 140 (11), 3687-3692, 2012 | 69 | 2012 |

Exact computation of the hypergraph Turán function for expanded complete 2-graphs O Pikhurko Journal of Combinatorial Theory, Series B 103 (2), 220-225, 2013 | 63 | 2013 |

Lattice points in lattice polytopes O Pikhurko Mathematika 48 (1-2), 15-24, 2001 | 61 | 2001 |

Results and open problems on minimum saturated hypergraphs O Pikhurko Ars Combinatoria 72, 111-127, 2004 | 60 | 2004 |

Asymptotic structure of graphs with the minimum number of triangles O Pikhurko, A Razborov Combinatorics, Probability and Computing 26 (1), 138-160, 2017 | 59 | 2017 |

An exact Turán result for the generalized triangle O Pikhurko Combinatorica 28, 187-208, 2008 | 59 | 2008 |

The maximum number of *K*_{3}‐free and *K*_{4}‐free edge 4‐coloringsO Pikhurko, ZB Yilma Journal of the London Mathematical Society 85 (3), 593-615, 2012 | 56 | 2012 |

On triple systems with independent neighbourhoods Z Füredi, O Pikhurko, M Simonovits Combinatorics, Probability and Computing 14 (5-6), 795-813, 2005 | 53 | 2005 |

Minimum number of k-cliques in graphs with bounded independence number O Pikhurko, ER Vaughan Combinatorics, Probability and Computing 22 (6), 910-934, 2013 | 51 | 2013 |

A new generalization of Mantel's theorem to k-graphs D Mubayi, O Pikhurko Journal of Combinatorial Theory, Series B 97 (4), 669-678, 2007 | 43 | 2007 |

The Turán Density of the Hypergraph $\{abc, ade, bde, cde\} $ Z Füredi, O Pikhurko, M Simonovits the electronic journal of combinatorics, R18-R18, 2003 | 43 | 2003 |

On possible Turán densities O Pikhurko Israel Journal of Mathematics 201, 415-454, 2014 | 40 | 2014 |

How complex are random graphs in first order logic? JH Kim, O Pikhurko, JH Spencer, O Verbitsky Random Structures & Algorithms 26 (1‐2), 119-145, 2005 | 39 | 2005 |

Minimum number of monotone subsequences of length 4 in permutations J Balogh, P Hu, B Lidický, O Pikhurko, B Udvari, J Volec Combinatorics, Probability and Computing 24 (4), 658-679, 2015 | 38 | 2015 |

Primality of trees P Haxell, O Pikhurko, A Taraz Journal of Combinatorics 2 (4), 481-500, 2011 | 38 | 2011 |

Maximizing the number of *q*‐coloringsPS Loh, O Pikhurko, B Sudakov Proceedings of the London Mathematical Society 101 (3), 655-696, 2010 | 34 | 2010 |

The Erdős–Rothschild problem on edge-colourings with forbidden monochromatic cliques O Pikhurko, K Staden, ZB Yilma Mathematical proceedings of the cambridge philosophical society 163 (2), 341-356, 2017 | 33 | 2017 |

The minimum size of saturated hypergraphs O Pikhurko Combinatorics, Probability and Computing 8 (5), 483-492, 1999 | 32 | 1999 |