17 citations to https://www.mathnet.ru/eng/jgt1
-
Andrzej Grzesik, Daniel Král', Oleg Pikhurko, “Forcing generalised quasirandom graphs efficiently”, Combinator. Probab. Comp., 33:1 (2024), 16
-
Victor Falgas‐Ravry, Oleg Pikhurko, Emil Vaughan, Jan Volec, “The codegree threshold of K4−$K_4^{-}$”, Journal of London Math Soc, 107:5 (2023), 1660
-
Andrzej Grzesik, Daniel Il'kovič, Bartłomiej Kielak, Daniel Král', “Quasirandom-Forcing Orientations of Cycles”, SIAM J. Discrete Math., 37:4 (2023), 2689
-
Andrzej Grzesik, Daniel Král', László M. Lovász, Jan Volec, “Cycles of a given length in tournaments”, Journal of Combinatorial Theory, Series B, 158 (2023), 117
-
Leonardo N. Coregliano, Alexander A. Razborov, “Natural quasirandomness properties”, Random Structures Algorithms, 63:3 (2023), 624–688
-
Andrzej Grzesik, Daniel Kráľ, Oleg Pikhurko, Proceedings of the 12th European Conference on Combinatorics, Graph Theory and Applications, 2023, 503
-
Robert Hancock, Adam Kabela, Daniel Král', Taísa Martins, Roberto Parente, Fiona Skerman, Jan Volec, “No additional tournaments are quasirandom-forcing”, European Journal of Combinatorics, 108 (2023), 103632
-
Martin Kurečka, “Lower bound on the size of a quasirandom forcing set of permutations”, Combinator. Probab. Comp., 31:2 (2022), 304
-
Jacob W. Cooper, Daniel Král', Ander Lamaison, Samuel Mohr, “Quasirandom Latin squares”, Random Struct Algorithms, 61:2 (2022), 298
-
Matija Bucić, Eoin Long, Asaf Shapira, Benny Sudakov, “Tournament Quasirandomness from Local Counting”, Combinatorica, 41:2 (2021), 175