Low rank co-diagonal matrices and Ramsey graphs

Electronic Journal of Combinatorics

Volumn 7, Issue 1 R, 2000, Pages 1-7

  Grolmusz, Vince ^a  

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

Author keywords

Co diagonal matrices; Composite modulus; Explicit Ramsey graph constructions; Matrices over rings

Indexed keywords

EID: 0011229016     PISSN: 10778926     EISSN: None     Source Type: Journal    
DOI: 10.37236/1493     Document Type: Article

References (8)

1. N. Alon. The Shannon capacity of a union. Combinatorica, 18:301-310, 1998.
2. L. Babai and P. Frankl. Linear algebra methods in combinatorics. Department of Computer Science, The University of Chicago, September 1992. preliminary version.
3. D. A. M. Barrington, R. Beigel, and S. Rudich. Representing Boolean functions as polynomials modulo composite numbers. Comput. Complexity, 4:367-382, 1994. Appeared also in Proc. 24th Ann. ACM Symp. Theor. Comput., 1992.
4. D. A. M. Barrington, R. Beigel, and S. Rudich. Representing Boolean functions as polynomials modulo composite numbers. Comput. Complexity, 4:367-382, 1994. Appeared also in Proc. 24th Ann. ACM Symp. Theor. Comput., 1992.
5. P. Erdos and G. Szekeres. A combinatorial problem in geometry. Composition Math., 2:464-470, 1935.
6. P. Frankl and R. M. Wilson. Intersection theorems with geometric consequences. Combinatorica, 1(4):357-368, 1981.
7. V. Grolmusz. Superpolynomial size set systems with restricted intersections mod 6 and explicit Ramsey graphs. Combinatorica, 20:1-14, 2000. Conference version appeared in Proc. COCOON'97, LNCS 1276.
8. F. P. Ramsey. On a problem of formal logic. Proc. London Math. Soc., 30:264-286, 1930.