combinatoricsgraph theory
The question I have is: How many cycles of Length 4 are there in a Complete Bipartite graph in $K_{n,n}$? I can see there is 1 distinct cycle in $K_{2,2}$ but after that I can't seem to get it straight. I think I can see 4 distinct 4 cycles in $K_{3,3}$ but am not sure as I keep losing track of which I have counted. Thus I can't get past that to see a relationship and work from there. Any ideas?
Thanks,
Brian
Your idea is correct and doesn't have that many cases, you can simplify it quite a bit. Let $C$ be an odd cycle in $G$ of minimum length, this assures that $C$ isn't hamiltonian and there is a vertex $v\in V(G)\setminus V(C)$. As you said, there are 3 disjoint paths $t_1$, $t_2$ and $t_3$ between $v$ and $C$. Call $x_i$ the extreme of $t_i$ in $C$. Observe that for $i\neq j$, there are two $x_ix_j$-paths contained in $C$, one of even length and one of odd length. Define the cycle $C_{i,j}$ as follows:
Hence, the four odd cycles are $C$, $C_{1,2}$, $C_{1,3}$ and $C_{2,3}$.
Let's look at bicubic planar graphs. As you say, there must be $2n$ vertices, $3n$ edges, and $n+2$ faces for some $n$. Suppose there are $F_j$ faces of length $j$; then we want lower and upper bounds on $F_4$ in terms of $n$.
Note that every 4-cycle in the graph must be a face in the planar embedding, because any chord in the 4-cycle would give you cycles of length 3, impossible in a bipartite graph. The graph you have at the end of the question is not a counterexample because it is not cubic (in a 3-regular graph, there would be two triangles on the bottom.)
The upper bound is $n+2$. This is obviously the maximum possible because it is the total number of faces, and it is achieved by the cube graph, where $n = 4$.
This is the only graph that achieves the bound, because it is the only cubic planar graph consisting only of squares. If all the faces are squares, then 4 times the number of faces must be 3 times the number of vertices, or $$ 4(n+2) = 6n $$ so $n = 4$.
If we exclude this single graph, then the upper bound is $n$, and graphs with $F_4 = n$ can be found for arbitrarily large $n$ (see the prism graph at the end of this answer.)
To prove this, we need to show that we cannot have $n + 1$ 4-sided faces and a single $j$-sided face, with $j > 4$. In this case $$ 6n = 4F_4 + jF_j = 4(n+1) + j $$ so $j = 2n - 4$. The same logic as this answer by Henning Makholm applies:
Now start by drawing the face with $2n - 4$ sides. That uses up $2n -4$ nodes. Since the graph is cubic, each of these nodes have an extra neighbor. But if those neighbors are all different, then there would be at least $4n - 8$ nodes in the graph which is too many.
Therefore, there must be a pair of corners of the $j$-gon that share a neighbor outside the $j$-gon. Since [all other faces are 4-cycles], this is only possible if these two nodes are separated by one corner in the $j$-gon. But then it's impossible for the extra leg of the corner between them to connect to anything, which is absurd. So the graph cannot exist.
(It's not that absurd to have an edge going to another graph component contained within a face, but such an edge would be a cut-edge, which cannot exist in a regular bipartite graph.)
The lower bound is an arbitrarily small multiple of $n$. We can see this by applying a bitruncation operation, which replaces every vertex by a hexagon and leaves a smaller version of each face (with the same number of sides). Thus, starting from the cube, we get a bitruncated cube (aka truncated octahedron) with 6 squares and 8 hexagons ($n = 12$).
Bitruncating that gives a polyhedron with 6 squares and 32 hexagons ($n = 36$).
Bitruncating that gives a polyhedron with 6 squares and 104 hexagons ($n = 108$).
Here are the corresponding planar graphs:
In general, bitruncating yields a graph with 3 times as many vertices and the same number of squares, so we can keep going and get $F_4$ to be less than $\epsilon n$ for any $\epsilon > 0$.
Another option would be a chamfering operation, which replaces every edge by a hexagon and every face by a smaller face of the same number of sides. Starting from the cube, this gives you 4 times as many vertices with each step, so $n$ grows even faster, while always keeping 6 squares.
As you mention, any 3-regular planar bipartite graph must have at least 6 squares (assuming you forbid digons, that is, two edges between the same vertices). One way to show this is that 3 times the number of vertices equals the sum of each face's length, so
$$\begin{align} 6n &= 4F_4 + 6F_6 + 8F_8 + \ldots \\ &\geq 4F_4 + 6(n+2-F_4) \\ &= 6n + 12 - 2F_4 \\ 2F_4 &\geq 12 \\ F_4 &\geq 6. \end{align}$$
(If you allow digons, you can get this guy with two squares: 
)
There is no absolute upper bound on $F_4$ (independent of $n$), since you can have prism graphs with arbitrarily many squares:
These all have $F_4 = n$ and are bipartite for any even $n$.
Best Answer
HINT: Let $V_0$ and $V_1$ be the two parts of $K_{n,n}$, so that each consists of $n$ vertices. Every $4$ cycle contains two vertices from $V_0$ and two from $V_1$. Suppose that you pick $v_0,v_1\in V_0$ and $u_0,u_1\in V_1$, where $v_0\ne v_1$ and $u_0\ne u_1$. They and their connecting edges form a little $K_{2,2}$, which indeed has one $4$-cycle. Thus, $K_{n,n}$ has exactly as many $4$-cycles as there are ways to pick two vertices from $V_0$ and two from $V_1$.