Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

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

How do i formulate this proof?

Prove that every finite graph can be drawn in the 3D euclidean space with no crossings.

share|cite|improve this question

Just pick any point set with no 4 points lying on a common plane. Then clearly there can be no intersections. You can construct such an point set incrementally.

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.