Complete bipartite graph

Example

Let $m$ and $n$ be natural numbers. The complete bipartite graph $K_{m,n}$ is the graph whose vertex set is a disjoint union $A \sqcup B$ with $|A| = m$ and $|B| = n$. Two vertices are adjacent if and only if one is in $A$ and the other is in $B$.