Bounds on pairs of families with restricted intersections

Combinatorica

Volumn 19, Issue 4, 1999, Pages 555-566

  Sgall, Jiří ^a,b  

^a MATHEMATICAL INSTITUTE   (Czech Republic)

^b CHARLES UNIVERSITY   (Czech Republic)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0040707335     PISSN: 02099683     EISSN: None     Source Type: Journal    
DOI: 10.1007/s004939970007     Document Type: Article

References (14)

1. R. AHLSWEDE, N. CAI, and Z. ZHANG: A general 4-words inequality with consequences for 2-way communication complexity, Advances in Applied Mathematics, 10 (1989), 75-94.
2. N. ALON and J. H. SPENCER: The Probabilistic Method, Wiley, 1992.
3. L. BABAI and P. FRANKL: Linear Algebra Methods in Combinatorics, Preliminary Version 2, Dept. of Computer Science, The Univesity of Chicago, 1992.
4. B. BOLLOBÁS: Combinatorics - Set Systems, Hypergraphs, Families of Vectors, and Combinatorial Probability, Cambridge University Press, 1986.
5. P. FRANKL: A constructive lower bound for some Ramsey numbers, Ars Combinatoria, 3 (1977), 297-302.
6. P. FRANKL: Extremal set systems, in: Handbook of Combinatorics, (R. L. Graham, M. Grötschel, and L. Lovász, editors), Elsevier, 1995, volume 1, chapter 24, 1293-1329.
7. P. FRANKL and V. RÖDL: Forbidden intersections, Transactions of the American Mathematical Society, 300 (1) (1987), 259-286.
8. P. FRANKL and R. M. WILSON: Intersection theorems with geometric consequences, Combmatorica, 1 (1981), 313-368.
9. V. GROLMUSZ: On set systems with restricted intersections modulo a composite number, in: Proceedings of the 3rd Ann. International Computing and Combinatorics Conference, Lecture Notes in Computer Science 1276, Springer-Verlag, 1997, 82-90.
10. D. J. KLEITMAN: Families of non-disjoint subsets, Journal of Combinatorial Theory, 1 (1966), 153-155.
11. E. KUSHILEVITZ and N. NISAN: Communication Complexity, Cambridge University Press, 1996.
12. L. LOVÁSZ AND M. SAKS: Lattices, Möbius functions, and communication complexity, in: Proceedings of the 29th Annual IEEE Symposium on Foundations of Computer Science, IEEE, 1988, 81-90.
13. N. NlSAN and A. WIGDERSON: On rank vs. communication complexity, in: Proceedings of the 35th Annual IEEE Symposium on Foundations of Computer Science, IEEE, 1994, 831-836.
14. D. K. RAY-CHAUDHURI and R. M. WILSON: On t-designs, Osaka J. Math., 12 (1975), 737-744.