Superpolynomial Size Set-systems with Restricted Intersections mod 6 and Explicit Ramsey Graphs

Dedicated to the memory of Paul Erdős

We construct a system of subsets of a set of n elements such that the size of each set is divisible by 6 but their pairwise intersections are not divisible by 6. The result generalizes to all non-prime-power moduli m in place of m=6. This result is in sharp contrast with results of Frankl and Wilson (1981) for prime power moduli and gives strong negative answers to questions by Frankl and Wilson (1981) and Babai and Frankl (1992). We use our set-system to give an explicit Ramsey-graph construction, reproducing the logarithmic order of magnitude of the best previously known construction due to Frankl and Wilson (1981). Our construction uses certain mod m polynomials, discovered by Barrington, Beigel and Rudich (1994).

This is a preview of subscription content, access via your institution.

Author information

Affiliations

Authors

Additional information

Received January 15, 1996/Revised August 2, 1999

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Grolmusz, V. Superpolynomial Size Set-systems with Restricted Intersections mod 6 and Explicit Ramsey Graphs. Combinatorica 20, 71–86 (2000). https://doi.org/10.1007/s004930070032

Download citation

  • AMS Subject Classification (1991) Classes:  05D05, 05D10, 68Q25