Statement: any bipartite graph contains a Hamiltonian cycle.
My answer: No. A bipartite graph which have an odd number of vertices cannot contain a Hamiltonian cycle, since each simple cycle in a bipartite graph has an even number of edges and, therefore, contains an even number of vertices.