Take the 2-minute tour ×
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

I'm having a bit of trouble with this homework problem: If $G=(V, E)$ is a connected bipartite undirected graph with $V$ partitioned as $V_1\cup V_2$, how can I prove the existence of a Hamilton path in $G$ implies that $|V_1|-|V_2|\in\{-1, 0, 1\}$?

share|improve this question

1 Answer 1

Hint: Since $G$ is bipartite, any two adjacent vertices in your Hamiltonian path must be in separate subsets.

How many choices are there for the subset that contains the initial vertex of the path? How many choices are there for the subset that contains the terminal vertex of the path? What do these cases together imply about the cardinalities of $V_1$ and $V_2$?

share|improve this answer

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.