  In this paper, we investigate the set of sizes of induced subgraphs of
bipartite graphs. We introduce the definition of $C$-$Bipartite$-$Ramsey$
graphs, which is closely related to Ramsey graphs and prove that in `most'
cases, these graphs have multiplication tables of $\Omega(e(G))$ in size. We
apply our result to give direct evidence to the conjecture that the complete
bipartite graph $K_{n,n}$ is the minimiser of the multiplication table on $n^2$
edges raised by Narayanan, Sahasrabudhe and Tomon.
