Superpolynomial size set-systems with restricted intersections mod 6 and explicit Ramsey graphs

Combinatorica

Volumn 20, Issue 1, 2000, Pages 71-86

  Grolmusz, Vince ^a  

^a EÖTVÖS LORÁND UNIVERSITY   (Hungary)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0034363403     PISSN: 02099683     EISSN: None     Source Type: Journal    
DOI: 10.1007/s004930070032     Document Type: Article

References (14)

1. N. ALON: The Shannon capacity of a union, Combinatorica, 18 (1998) 301-310.
2. L. BABAI and P. FRANKL: Linear algebra methods in combinatorics, Department of Computer Science, The University of Chicago, September 1992 (preliminary version 2 of the monograph)
3. L. BABAI, H. SNEVILY, and R. M. WILSON: A new proof for several inequalities on codes and sets, J. Combinatorial Theory Ser. A, 71 (1995), 146-153.
4. L. BABAI, P. FRANKL, S. KUTIN, D. ŠTEFANKOVIČ: Set systems with restricted intersections modulo prime powers, manuscript, 1999.
5. D. A. M. BARRINGTON, R. BEIGEL, and S. RUDICH: Representing Boolean functions as polynomials modulo composite numbers, Comput. Complexity, 4 (1994), 367-382. Preliminary version appeared in Proc. 24th Ann. ACM Symp. Theor. Comput., 1992, 455-461.
6. D. A. M. BARRINGTON, R. BEIGEL, and S. RUDICH: Representing Boolean functions as polynomials modulo composite numbers, Comput. Complexity, 4 (1994), 367-382. Preliminary version appeared in Proc. 24th Ann. ACM Symp. Theor. Comput., 1992, 455-461.
7. R. BEIGEL and J. TARUI: On ACC, Comput. Complexity, 4 (1994), 350-366.
8. P. ERDOS: Some remarks on the theory of graphs, Bull. Amer. Math. Soc., 53 (1947), 292-294.
9. P. FRANKL: Constructing finite sets with given intersections, Ann. Disc. Math., 17 (1983), 289-291.
10. P. FRANKL and R. M. WILSON: Intersection theorems with geometric consequences, Combinatorica, 1 (1981), 357-368.
11. J. KAHN and G. KALAI: A counterexample to Borsuk's conjecture, Bull. Amer. Math. Soc. (N.S.), 29 (1) (1993), 60-62.
12. D. K. RAY-CHAUDHURI and R. M. WILSON: On t-designs, Osaka J. Math., 12 (1975), 735-744.
13. G. TARDOS and D. A. M. BARRINGTON: A lower bound on the MOD 6 degree of the OR function, Comput. Complex., 7 (1998), 99-108. Preliminary version appeared in Proceedings of the Third Israel Symosium on the Theory of Computing and Systems (ISTCS'95), 1995, 52-56.
14. G. TARDOS and D. A. M. BARRINGTON: A lower bound on the MOD 6 degree of the OR function, Comput. Complex., 7 (1998), 99-108. Preliminary version appeared in Proceedings of the Third Israel Symosium on the Theory of Computing and Systems (ISTCS'95), 1995, 52-56.