- Bernard Lidický, Florian Pfender, “Pentagons in triangle-free graphs”, European Journal of Combinatorics, 74, 2018, 85
- L. Lovász, B. Szegedy, “Finitely forcible graphons”, Journal of Combinatorial Theory, Series B, 101, no. 5, 2011, 269
- Bojan Mohar, 20134658, Handbook of Graph Theory, Second Edition, 2013, 1038
- Xizhi Liu, Dhruv Mubayi, “The feasible region of hypergraphs”, Journal of Combinatorial Theory, Series B, 148, 2021, 23
- A. A. Razborov, “More about sparse halves in triangle-free graphs”, Sb. Math., 213, no. 1, 2022, 109
- Leonardo Nagami Coregliano, Alexander Alexandrovich Razborov, “Семантические пределы плотных комбинаторных объектов”, Успехи математических наук, 75, no. 4(454), 2020, 45
- Juanjo Rué, Christoph Spiegel, Proceedings of the 12th European Conference on Combinatorics, Graph Theory and Applications, 2023, 784
- Will Sawin, “An improved lower bound for multicolor Ramsey numbers and a problem of Erdős”, Journal of Combinatorial Theory, Series A, 188, 2022, 105579
- D. Conlon, W. T. Gowers, W. Samotij, M. Schacht, “On the KŁR conjecture in random graphs”, Isr. J. Math., 203, no. 1, 2014, 535
- Dan Hefetz, Mykhaylo Tyomkyn, “On the inducibility of cycles”, Journal of Combinatorial Theory, Series B, 133, 2018, 243