- Leonardo N. Coregliano, Alexander A. Razborov, “Natural quasirandomness properties”, Random Struct Algorithms, 63, № 3, 2023, 624
- Hao Huang, Nati Linial, Humberto Naves, Yuval Peled, Benny Sudakov, “On the 3‐Local Profiles of Graphs”, Journal of Graph Theory, 76, № 3, 2014, 236
- József Balogh, Felix Christian Clemen, Bernard Lidický, 14, Extended Abstracts EuroComb 2021, 2021, 509
- Bernard Lidický, Connor Mattes, Florian Pfender, “C5 ${C}_{5}$ is almost a fractalizer”, Journal of Graph Theory, 104, № 1, 2023, 220
- József Balogh, Felix Christian Clemen, Adrian Dumitrescu, “Almost Congruent Triangles”, Discrete Comput Geom, 2024
- Raphael Yuster, “On the exact maximum induced density of almost all graphs and their inducibility”, Journal of Combinatorial Theory, Series B, 136, 2019, 81
- James Hirst, “The Inducibility of Graphs on Four Vertices”, Journal of Graph Theory, 75, № 3, 2014, 231
- Andrzej Grzesik, Ping Hu, Jan Volec, “Minimum number of edges that occur in odd cycles”, Journal of Combinatorial Theory, Series B, 137, 2019, 65
- Victor Falgas–Ravry, Edward Marchant, Oleg Pikhurko, Emil R. Vaughan, “The Codegree Threshold for 3-Graphs with Independent Neighborhoods”, SIAM J. Discrete Math., 29, № 3, 2015, 1504
- A V Il’ev, V P Il’ev, “On axiomatizability and decidability of universal theories of hereditary classes of matroids”, J. Phys.: Conf. Ser., 1210, 2019, 012056