József Balogh, Haoran Luo, “Turán Density of Long Tight Cycle Minus One Hyperedge”, Combinatorica, 2024
Robert Hancock, Daniel Král', Matjaž Krnc, Jan Volec, “Toward characterizing locally common graphs”, Random Struct Algorithms, 62, no. 1, 2023, 181
Oleg Pikhurko, “The minimum size of 3-graphs without a 4-set spanning no or exactly three edges”, European Journal of Combinatorics, 32, no. 7, 2011, 1142
A. A. Razborov, “On Turán’s (3,4)-problem with forbidden subgraphs”, Math Notes, 95, no. 1-2, 2014, 245
Nati Linial, Avraham Morgenstern, “On the Number of 4-Cycles in a Tournament”, J. Graph Theory, 83, no. 3, 2016, 266
Jan Hladký, Ping Hu, Diana Piguet, “Komlós's tiling theorem via graphon covers”, Journal of Graph Theory, 90, no. 1, 2019, 24
Bernard Lidický, Florian Pfender, “Semidefinite Programming and Ramsey Numbers”, SIAM J. Discrete Math., 35, no. 4, 2021, 2328
Alexander A. Razborov, “On the Fon-Der-Flaass interpretation of extremal examples for Turán’s (3, 4)-problem”, Proc. Steklov Inst. Math., 274, no. 1, 2011, 247
Daniel Král’, Lukáš Mach, Jean-Sébastien Sereni, “A New Lower Bound Based on Gromov’s Method of Selecting Heavily Covered Points”, Discrete Comput Geom, 48, no. 2, 2012, 487
DANIEL KRÁL', CHUN-HUNG LIU, JEAN-SÉBASTIEN SERENI, PETER WHALEN, ZELEALEM B. YILMA, “A New Bound for the 2/3 Conjecture”, Combinator. Probab. Comp., 22, no. 3, 2013, 384