Constructing Ramsey Graphs from Boolean Function Representations

Explicit construction of Ramsey graphs or graphs with no large clique or independent set has remained a challenging open problem for a long time. While Erdos' probabilistic argument shows the existence of graphs on 2 n vertices with no clique or independent set of size 2n, the best explicit construc... View More