Let the two sets have sizes $n$ and $100-n$. Since the graph is complete bipartite, every vertex in the first set is connected to every vertex in the second set, and vice versa.
For the graph to have a Hamilton cycle, we need to be able to traverse all vertices
Show more…