| A problem of Erdős and Sós on 3-graphs R Glebov, D Kráľ, J Volec Israel Journal of Mathematics 211 (1), 349-366, 2016 | 50 | 2016 |
| 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 | 41 | 2015 |
| Rainbow triangles in three-colored graphs J Balogh, P Hu, B Lidický, F Pfender, J Volec, M Young Journal of Combinatorial Theory, Series B 126, 83-113, 2017 | 31 | 2017 |
| A bound on the inducibility of cycles D Kráľ, S Norin, J Volec Journal of Combinatorial Theory, Series A 161, 359-363, 2019 | 24* | 2019 |
| Characterization of quasirandom permutations by a pattern sum TFN Chan, D Král', JA Noel, Y Pehova, M Sharifzadeh, J Volec Random Structures & Algorithms, 2020 | 23 | 2020 |
| Subcubic triangle-free graphs have fractional chromatic number at most 14/5 Z Dvořák, JS Sereni, J Volec Journal of the London Mathematical Society 89 (3), 641-662, 2014 | 21 | 2014 |
| A note on acyclic vertex-colorings JS Sereni, J Volec Journal of Combinatorics 7 (4), 725-737, 2016 | 19 | 2016 |
| Fractional colorings of cubic graphs with large girth F Kardoš, D Král’, J Volec SIAM Journal on Discrete Mathematics 25 (3), 1454-1476, 2011 | 19 | 2011 |
| Limits of order types X Goaoc, A Hubard, RJ de Verclos, JS Sereni, J Volec arXiv preprint arXiv:1811.02236, 2018 | 18 | 2018 |
| Maximum edge‐cuts in cubic graphs with large girth and in random cubic graphs F Kardoš, D Král′, J Volec Random Structures & Algorithms 41 (4), 506-520, 2012 | 18 | 2012 |
| Properly colored and rainbow copies of graphs with few cherries B Sudakov, J Volec Journal of Combinatorial Theory, Series B 122, 391-416, 2017 | 17 | 2017 |
| Domination number of cubic graphs with large girth D Král', P Škoda, J Volec Journal of Graph Theory 69 (2), 131-142, 2012 | 15 | 2012 |
| On tripartite common graphs A Grzesik, J Lee, B Lidický, J Volec Combinatorics, Probability and Computing 31 (5), 907-923, 2022 | 14 | 2022 |
| Fractional coloring of triangle-free planar graphs Z Dvořák, JS Sereni, J Volec The Electronic Journal of Combinatorics 22 (4), #P4.11, 2015 | 14 | 2015 |
| Minimum number of edges that occur in odd cycles A Grzesik, P Hu, J Volec Journal of Combinatorial Theory, Series B 137, 65-103, 2019 | 13 | 2019 |
| The codegree threshold of K_4- V Falgas‐Ravry, O Pikhurko, E Vaughan, J Volec Journal of the London Mathematical Society 107 (5), 1660-1691, 2023 | 12* | 2023 |
| Non-bipartite k-common graphs D Kral, JA Noel, S Norin, J Volec, F Wei Combinatorica, 1-28, 2022 | 11 | 2022 |
| On the complexity of planar covering of small graphs O Bílka, J Jirásek, P Klavík, M Tancer, J Volec Graph-Theoretic Concepts in Computer Science: 37th International Workshop …, 2011 | 11 | 2011 |
| No additional tournaments are quasirandom-forcing R Hancock, A Kabela, T Martins, R Parente, F Skerman, J Volec European Journal of Combinatorics 108, 103632, 2023 | 9 | 2023 |
| Compactness and finite forcibility of graphons R Glebov, D Král, J Volec Journal of the European Mathematical Society 21 (10), 3199-3223, 2019 | 9 | 2019 |
Daniel KralMasaryk UniversityVerified email at fi.muni.cz
