Author:
Nie Jiaxi,Spiro Sam,Verstraëte Jacques
Funder
National Science Foundation Graduate Research Fellowship
National Science Foundation
Publisher
Springer Science and Business Media LLC
Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference29 articles.
1. Alon, N., Spencer, J.H.: The Probabilistic Method, pp. 97–100. Wiley, New York (2016)
2. Balogh, J., Bohman, T., Mubayi, D.: Erdős–Ko–Rado in random hypergraphs. Combin. Probab. Comput. 18(5), 629–646 (2009)
3. Balogh, J., Morris, R., Samotij, W.: The method of hypergraph containers. In: Proceedings of the International Congress of Mathematicians-Rio de Janeiro, vol. 3, pp. 3045–3078 (2018)
4. Balogh, J., Narayanan, B., Skokan, J.: The number of hypergraphs without linear cycles. J. Combin. Theory Ser. B 134, 309–321 (2019)
5. Balogh, J., Samotij, W.: The number of $$K_{s, t}$$-free graphs. J. Lond. Math. Soc. (2) 83(2), 368–388 (2011)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献