Highly Influenced

# Randomized graph products, chromatic numbers, and Lovasz theta-function

@inproceedings{Feige1995RandomizedGP, title={Randomized graph products, chromatic numbers, and Lovasz theta-function}, author={Uriel Feige}, booktitle={STOC}, year={1995} }

- Published 1995 in STOC
DOI:10.1145/225058.225281

For a graph G, let cr(G) denote the size of the largest independent set in G, and let O(G) denote the Lovasz t?function on G. We prove that for some c > 0, there exists an infinite family of graphs such that O(G) > cr(G)n/2c=, where n denotes the number of vertices in a graph. This disproves a known conjecture regarding the d function. As part of our proof, we analyse the behavior of the chromatic number in graphs under a randomized version of graph products. This analysis extends earlier work… CONTINUE READING