Maximum no. of edges occur in a complete bipartite graph i.e. when every vertex has an edge to every opposite vertex.
Number of edges in a complete bipartite graph is $mn$, where $m$ and $n$ are no. of vertices on each side. This quantity is maximum when $m = n$ i.e. when there are $6$ vertices on each side, so answer is $36$.