Thanks sm for the video!! It's so clear and helped me understand a lot more than my professor. Also, thanks for making mistakes and having moments where you had to think for a second haha they gave me a nice laugh and breather from all the content, but also helped keep me paying attention once I caught them.
Can there be an Eulerian cycle where we "paint us into a corner" where we cannot complete the path through all vertices with using every edge only once? It seems to me now No, there cannot be such a cycle, but how would I prove it?
![[Discrete Mathematics] Euler Circuits and Euler Trails](http://i.ytimg.com/vi/Ou345pSYDoE/mqdefault.jpg)
Thanks sm for the video!! It's so clear and helped me understand a lot more than my professor. Also, thanks for making mistakes and having moments where you had to think for a second haha they gave me a nice laugh and breather from all the content, but also helped keep me paying attention once I caught them.
Can there be an Eulerian cycle where we "paint us into a corner" where we cannot complete the path through all vertices with using every edge only once? It seems to me now No, there cannot be such a cycle, but how would I prove it?
Can a graph with a single node have an Eulerian Path?
the path doesnt exist
Yes if it has self loops. Because the degree will always be even
keep it up!!
thanks