Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Discrete Mathematics and Combinatorics
Reference21 articles.
1. Erdős, Paul, Rado, Richard: Intersection theorems for systems of sets. J. London Math. Soc. 35, 85–90 (1960)
2. Chung, L., Fan, R.K.: Open problems of Paul Erdos in graph theory. J. Graph. Theory 25(1), 3–36 (1997)
3. Alweiss, R., Lovett, S., Wu, K., Zhang, J.: Improved bounds for the sunflower lemma. Ann. Math. 194(3), 795–815 (2021)
4. Rao, A.: Coding for sunflowers. Discret. Anal. 2, 8 (2020)
5. Tao, T.: The sunflower lemma via shannon entropy, (2020). https://terrytao.wordpress.com/2020/07/20/the-sunflower-lemma-via-shannon-entropy