This question possibly ridiculous but I constantly found the interesting... Below it is :(I cannot put picture so I placed you the link of the pictures)When i was in college I offered to draw houses as soon as I was bored :


You can attract it without lifting the pen. However then i tried to attract two houses side-to-side :


Then i realized you cannot actually execute it there is no lifting the pen. Ns tried any type of ways i could. You finish up all the time with one heat missing.

That"s why i was wonder whether over there existed a proof that ns cannot actually execute it.

You are watching: Draw a house without lifting pencil

I heard that we need to count the total number of lines and also the number of intersections and also that this number tells us something but I am not certain at all.

I to be a an initial year cg-tower.coms college student so i haven"t learned graph theory yet !

Thanks !



This sounds prefer a good excuse to research (just a little) graph concept to me! inspect out the conclusions that Euler in this well known problem. It need to tell you every you need to understand (and more). In particular, the second figure has actually $4$ nodes of odd degree (that is, an odd number of segments having actually that typical endpoint)--the external bottom corners and also the 2 nodes where the "houses" meet--so it cannot be traced there is no lifting the pen or retracing at the very least one segment that the path.



Take a peak with 3 edges. Assume you carry out NOT begin there. Then there is a first time you will certainly reach this vertex, through among the possible paths resulting in it. It i will not ~ be the end of her drawing because two various other paths are not however traversed. Thus, you will leave this vertex, with a second adjacent path. As a result, once you traverse the third path some time, girlfriend won’t have the ability to leave this vertex since no untraveled courses will it is in available. In various other words, your drawing will have actually to end here.

So, we confirmed that if friend don’t start at a crest (with odd number of edges), friend will have actually to end there.

This is likewise true around vertices with 5 edges. Thus, if any type of graph has an ext than two vertices v odd degrees, you won"t have the ability to draw it.


Thanks for contributing an answer to Stack Exchange!

Please be sure to answer the question. Carry out details and also share your research!

But avoid

Asking for help, clarification, or responding to various other answers.Making statements based on opinion; ago them up with references or an individual experience.

Use cg-tower.comJax to style equations. cg-tower.comJax reference.

See more: What Is 120 Degrees In Celsius, 120 F To C (120 Fahrenheit To Celsius)

To learn more, view our tips on writing great answers.

short article Your prize Discard

By clicking “Post your Answer”, you agree to our terms of service, privacy policy and cookie plan

Not the price you're feather for? Browse various other questions tagged graph-theory eulerian-path or ask your own question.

site style / logo design © 2021 ridge Exchange Inc; user contributions license is granted under cc by-sa. Rev2021.10.22.40538

your privacy

By click “Accept every cookies”, friend agree ridge Exchange have the right to store cookies on your device and disclose details in accordance v our Cookie Policy.