Bounds on Pairs of Families with Restricted Intersections
暂无分享,去创建一个
[1] D. Kleitman. Families of Non-disjoint subsets* , 1966 .
[2] Vince Grolmusz. On Set Systems with Restricted Intersections Modulo a Composite Number , 1997, COCOON.
[3] Noam Nisan,et al. On rank vs. communication complexity , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.
[4] Rudolf Ahlswede,et al. A general 4-words inequality with consequences for 2-way communication complexity , 1989 .
[5] Michael Saksl. Lattices, MEbius Functions and Communication Complexity , 1988 .
[6] B. Bollobás. Combinatorics: Set Systems, Hypergraphs, Families of Vectors and Combinatorial Probability , 1986 .
[7] Richard M. Wilson,et al. On $t$-designs , 1975 .
[8] Noga Alon,et al. The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.
[9] P. Frankl. Extremal set systems , 1996 .
[10] Peter Frankl,et al. Intersection theorems with geometric consequences , 1981, Comb..