On the number of pentagons in triangle-free graphs H Hatami, J Hladký, D Králʼ, S Norine, A Razborov Journal of Combinatorial Theory, Series A 120 (3), 722-732, 2013 | 115 | 2013 |

Counting flags in triangle-free digraphs J Hladký, S Norin Combinatorica 37 (1), 49-76, 2017 | 58 | 2017 |

Rank of divisors on tropical curves J Hladký, D Králʼ, S Norine Journal of Combinatorial Theory, Series A 120 (7), 1521-1538, 2013 | 48* | 2013 |

Non-three-colourable common graphs exist H Hatami, J Hladký, S Norine, A Razborov Combinatorics, Probability and Computing 21 (05), 734-742, 2012 | 47 | 2012 |

Brooks’ theorem via the Alon–Tarsi theorem J Hladký, D Král, U Schauz Discrete Mathematics 310 (23), 3426-3428, 2010 | 39 | 2010 |

Loebl–Komlós–Sós conjecture: dense case J Hladký, D Piguet Journal of Combinatorial Theory, Series B 116, 123-190, 2016 | 38 | 2016 |

An approximate version of the tree packing conjecture J Böttcher, J Hladký, D Piguet, A Taraz Israel journal of mathematics 211 (1), 391-446, 2016 | 27 | 2016 |

The approximate Loebl-Komlós-Sós Conjecture I: The sparse decomposition J Hladký, J Komlós, D Piguet, M Simonovits, MJ Stein, E Szemerédi arXiv preprint arXiv:1408.3858, 2014 | 27 | 2014 |

The approximate Loebl–Komlós–Sós Conjecture IV: Embedding techniques and the proof of the main result J Hladký, J Komlós, D Piguet, M Simonovits, M Stein, E Szemerédi arXiv preprint arXiv:1408.3870, 2014 | 26 | 2014 |

The approximate Loebl–Komlós–Sós Conjecture III: The finer structure of LKS graphs J Hladký, J Komlós, D Piguet, M Simonovits, M Stein, E Szemerédi arXiv preprint arXiv:1408.3866, 2014 | 25 | 2014 |

The approximate Loebl–Komlós–Sós Conjecture II: The rough structure of LKS graphs J Hladký, J Komlós, D Piguet, M Simonovits, M Stein, E Szemerédi arXiv preprint arXiv:1408.3871, 0 | 25* | |

Poset limits can be totally ordered J Hladký, A Máthé, V Patel, O Pikhurko Transactions of the American Mathematical Society 367 (6), 4319-4337, 2015 | 17 | 2015 |

The approximate Loebl-Komlós-Sós conjecture and embedding trees in sparse graphs J Hladky, D Piguet, M Simonovits, M Stein, E Szemeredi arXiv preprint arXiv:1406.3935, 2014 | 16 | 2014 |

Packing degenerate graphs P Allen, J Böttcher, J Hladký, D Piguet Advances in Mathematics 354, 106739, 2019 | 15 | 2019 |

Note on bipartite graph tilings J Hladký, M Schacht SIAM Journal on Discrete Mathematics 24 (2), 357-362, 2010 | 14 | 2010 |

Cliques in dense inhomogeneous random graphs M Doležal, J Hladký, A Máthé Random Structures & Algorithms 51 (2), 275-314, 2017 | 12 | 2017 |

A Density Corrádi–Hajnal Theorem P Allen, J Böttcher, J Hladký, D Piguet Canadian Journal of Mathematics 67 (4), 721-758, 2015 | 12* | 2015 |

Almost all trees are almost graceful A Adamaszek, P Allen, C Grosu, J Hladky arXiv preprint arXiv:1608.01577, 2016 | 11 | 2016 |

Turánnical hypergraphs P Allen, J Böttcher, J Hladký, D Piguet Random Structures & Algorithms 42 (1), 29-58, 2013 | 11 | 2013 |

’, and S. Norine J Hladký, D Král Counting flags in triangle-free digraphs, 621-625, 0 | 11 | |