- Sven C. Polak, “Symmetry Reduction to Optimize a Graph-based Polynomial From Queueing Theory”, SIAM J. Appl. Algebra Geometry, 6, № 2, 2022, 243
- Ehud Hrushovski, Quantum, Probability, Logic, 2020, 375
- Hong Liu, Oleg Pikhurko, Katherine Staden, “The minimum number of triangles in graphs of given order and size”, Electronic Notes in Discrete Mathematics, 61, 2017, 805
- Miklós Simonovits, Endre Szemerédi, 28, Building Bridges II, 2019, 445
- Shagnik Das, Hao Huang, Jie Ma, Humberto Naves, Benny Sudakov, “A problem of Erdős on the minimum number of k -cliques”, Journal of Combinatorial Theory, Series B, 103, № 3, 2013, 344
- Christian Reiher, Vojtĕch Rödl, Mathias Schacht, “On a generalisation of Mantel’s Theorem to Uniformly Dense Hypergraphs”, International Mathematics Research Notices, 2018, № 16, 2018, 4899
- Ilkyoo Choi, Bernard Lidický, Florian Pfender, “Inducibility of directed paths”, Discrete Mathematics, 343, № 10, 2020, 112015
- DANIEL KRÁL', BERNARD LIDICKÝ, TAÍSA L. MARTINS, YANITSA PEHOVA, “Decomposing Graphs into Edges and Triangles”, Combinator. Probab. Comp., 28, № 3, 2019, 465
- Jan Hladký, András Máthé, Viresh Patel, Oleg Pikhurko, “Poset limits can be totally ordered”, Trans. Amer. Math. Soc., 367, № 6, 2015, 4319
- Marcos A. Crespo, Christopher J. Rapuano, Zeba A. Syed, “Applications of Mitomycin C in Cornea and External Disease”, tjo, 53, № 3, 2023, 175