A biclique in a graph Gamma is a complete bipartite subgraph of Gamma. We g
ive bounds for the maximum number of edges in a biclique in terms of the ei
genvalues of matrix representations of Gamma. These bounds show a strong si
milarity with Lovasz's bound theta(Gamma) for the Shannon capacity of Gamma
. Motivated by this similarity we investigate bicliques and the bounds in c
ertain product graphs. (C) 2001 Academic Press.