We define $F(n,m,k)$ as the family of bipartie graphs $G$ with two disjoint independent (vertex) sets $U$ and $V$ satisfying that
the cardinality of $U$ is $|U|=n$ and the cardinality of $V$ is $|V|=m$.
the valency of each vertex in $U$ is $k$.
We denote $f(G)$ as the maximum number of $pq$ where $G$ contains a complete bipartite graph with two disjoint independent sets $U'$ and $V'$ with $|U'|=p$ and $|V'|=q$. For a triple $(n,m,k)$, we denote by $f(n,m,k)$ the minimum value of $f(G)$ as $G$ ranges over all graphs in $F(n,m,k)$.
I would like to estimate the lower bound for $f(n,m,k)$. Thanks in advance.
