What is the maximum number of edges in a bipartite graph with vertex sets of size $m$ and $n$?