20 citations to https://www.mathnet.ru/rus/jgt1
  1. Raphael Yuster, “Finding and counting small tournaments in large tournaments”, Theoretical Computer Science, 1024 (2025), 114911  crossref
  2. FREDERIK GARBE, DANIEL KRÁL', ALEXANDRU MALEKSHAHIAN, RAUL PENAGUIAO, “The dimension of the feasible region of pattern densities”, Math. Proc. Camb. Phil. Soc., 2025, 1  crossref
  3. Daniel Král', Ander Lamaison, Magdalena Prorok, Xichao Shu, “The Dimension of the Region of Feasible Tournament Profiles”, SIAM J. Discrete Math., 39:2 (2025), 1335  crossref
  4. Andrzej Grzesik, Daniel Král', Oleg Pikhurko, “Forcing generalised quasirandom graphs efficiently”, Combinator. Probab. Comp., 33:1 (2024), 16  crossref
  5. 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  crossref
  6. Andrzej Grzesik, Daniel Il'kovič, Bartłomiej Kielak, Daniel Král', “Quasirandom-Forcing Orientations of Cycles”, SIAM J. Discrete Math., 37:4 (2023), 2689  crossref
  7. 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  crossref
  8. Leonardo N. Coregliano, Alexander A. Razborov, “Natural quasirandomness properties”, Random Structures Algorithms, 63:3 (2023), 624–688  mathnet  crossref
  9. Andrzej Grzesik, Daniel Kráľ, Oleg Pikhurko, Proceedings of the 12th European Conference on Combinatorics, Graph Theory and Applications, 2023, 503  crossref
  10. 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  crossref
1
2
Следующая