Pseudorandom sets and explicit constructions of ramsey graphs

We shall show a polynomial time construction of a graph G on N vertices such that neither G nor G contains Kr,r, for r = √ N/2 √ log N = o( √ N). To this end we construct a subset X ⊆ F2 which has small intersections with all subspaces of dimension m/2.

[1]  A. Srinivasan.  Low-Discrepancy Sets For High-Dimensional Rectangles: A Survey , 2000, Bull. EATCS.

[2]  Vojtech Rödl,et al.  Graph complexity , 1988, Acta Informatica.

[3]  Vojtech Rödl,et al.  The number of submatrices of a given type in a Hadamard matrix and related results , 1988, J. Comb. Theory, Ser. B.

[4]  P. Erdös.  Some remarks on the theory of graphs , 1947 .

[5]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[6]  Peter Frankl,et al.  Intersection theorems with geometric consequences , 1981, Comb..

[7]  Pavel Pudlák,et al.  Threshold circuits of bounded depth , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[8]  José D. P. Rolim,et al.  Towards efficient constructions of hitting sets that derandomize BPP , 1996, Electron. Colloquium Comput. Complex..

[9]  Svante Janson,et al.  Random graphs , 2000, Wiley-Interscience series in discrete mathematics and optimization.

[10]  Noga Alon,et al.  Simple construction of almost k-wise independent random variables , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.