This question concerns subgraphs of graphs. In all cases, when we say $G_1$ is a subgraph of $G_2$, we mean that $G_1$ is isomorphic to some subgraph of $G_2$.
Are the following statements true or false?
False 1. Every bipartite graph is isomorphic to $K_{m,n}$ for some values of m and n.
False 2. If a graph is complete, then so too are all of its subgraphs.
True 3. $K_4$ is a subgraph of the Konigsberg Bridge multigraph.
False 4. If a graph is bipartite, then so too are all of its subgraphs.
True 5. Every graph of order 6 or less is isomorphic to a subgraph of $K_{3,3}$.
False 6. $C_4$ is a subgraph of the Konigsberg Bridge multigraph.