Author:
Watts Adam Bene,Norin Sergey,Yepremyan Liana
Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Discrete Mathematics and Combinatorics
Reference14 articles.
1. R. Ahlswede and L. H. Khachatrian: The complete intersection theorem for systems of finite sets, European J. Combin.18 (1997), 125–136.
2. A. Brandt, D. Irwin and T. Jiang: Stability and Tur_an numbers of a class ofhypergraphs via Lagrangians, Combinatorics, Probability, and Computing2 (2017), 367–405.
3. P. Frankl: The shifting technique in extremal set theory, Surveys in combinatorics1987 (New Cross, 1987), London Math. Soc. Lecture Note Ser., vol. 123, CambridgeUniv. Press, Cambridge, 1987, 81–110.
4. P. Frankl and V. Rődl: Hypergraphs do not jump, Journal of Symbolic Logic4(1984), 149–159.
5. E. Friedgut: On the measure of intersecting families, uniqueness and stability, Combinatorica28 (2008), 503–528.
Cited by
13 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献