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.

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

I'm trying to prove that a Hamilton path is the only topological sort. I think I need to show that in case there are two topological sorts, none of them is a Hamilton path.

How can I prove that a Hamilton path is the only topological sort in a DAG?

share|cite|improve this question

migrated from Jun 3 '14 at 10:55

This question came from our site for users of Mathematica.

up vote 0 down vote accepted

The main thing you need to observe is that an Hamilton path is a path that goes through all vertices. Think how can one dag have 2 different topological sorts

share|cite|improve this answer

Your Answer


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.