Nathan Keller, Noam Lifshitz, “The junta method for hypergraphs and the Erdős-Chvátal simplex conjecture”, Advances in Mathematics, 392, 2021, 107991
Zoltán Füredi, Tao Jiang, Robert Seiver, “Exact solution of the hypergraph Turán problem for k-uniform linear paths”, Combinatorica, 34, № 3, 2014, 299
Peter Frankl, Norihide Tokushige, “Uniform eventown problems”, European Journal of Combinatorics, 51, 2016, 280
Zoltán Füredi, Tao Jiang, Alexandr Kostochka, Dhruv Mubayi, Jacques Verstraëte, “Extremal Problems for Hypergraph Blowups of Trees”, SIAM J. Discrete Math., 37, № 4, 2023, 2397
Jason O'Neill, Jacques Verstraëte, “Non-trivial d-wise intersecting families”, Journal of Combinatorial Theory, Series A, 178, 2021, 105369
Tom Bohman, Xizhi Liu, Dhruv Mubayi, “Independent sets in hypergraphs omitting an intersection”, Random Struct Algorithms, 61, № 3, 2022, 493
M. Deza, 78, Combinatorics '81 in honour of Beniamino Segre, Proceedings of the International Conference on Combinatorial Geometrics and their Applications, 1983, 295
Alexander Barg, Oleg R. Musin, “Bounds on sets with few distances”, Journal of Combinatorial Theory, Series A, 118, № 4, 2011, 1465
P. Frankl, R. M. Wilson, “Intersection theorems with geometric consequences”, Combinatorica, 1, № 4, 1981, 357
Peter Frankl, “Families of finite sets with three intersections”, Combinatorica, 4, № 2-3, 1984, 141