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

Possible Duplicate:
Havel-Hakimi Theorem

Hi. I'm a beginner at graph theory, and I recently came across the Havel-Hakimi Theorem which is used to determine whether a sequence of integers is graphical. I am using Chartrand and Zhang's Introduction to Graph Theory, but I feel that the proof they provide is lacking. I am wondering whether anyone is aware of a proof for this theorem or where I can find one, preferably an easier one.

Thanks.

share|cite|improve this question

migrated from cstheory.stackexchange.com Jun 6 '11 at 15:51

This question came from our site for theoretical computer scientists and researchers in related fields.

marked as duplicate by t.b., Qiaochu Yuan Jun 6 '11 at 18:08

This question has been asked before and already has an answer. If those answers do not fully address your question, please ask a new question.

    
Hi intuit. I think this question is out of scope for cstheory and probably more appropriate for Math.SE. Please read the FAQ. – Kaveh Jun 6 '11 at 1:09
    
I'm sorry, is it possible to move it over to that forum? – Isaac Kleinman Jun 6 '11 at 2:50

The proof in the book "Pearls in Graph Theory" here is quite clear.

share|cite|improve this answer

Look at pages 44 and page 45 of the second edition of Doug West's book Introduction to Graph Theory for what I think is a clear account accompanied by a worked out example.

share|cite|improve this answer

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