Remember this: for there to be an Euler Path, there has to be 0 or 2 vertices with an odd degree, with the degree being the number of lines leading to that vertice and every other vertex degree has to be an even number because the path you are going on will start on the odd-degree vertex (if there is one) touch that vertex and go away. At some point, you will touch the starting point and the ending point (which is also an odd-degree vertex, if there is one).
Seriously, you have no idea how much your videos have helped me over the years. They helped me in high school, now they're supplements for my college lectures. Thank you so much.
Wonderful explanation. This helped a lot in reviewing the material for my discrete math class. To have an Euler Circuit, for every edge going "out" you need to have an edge going "in", thus an even degree for each vertex. For a path, the minimum condition is an additional edge after completing a circuit, creating two vertices with odd degrees.
Bless your heart!!!!!!! I have a test tomorrow afternoon and I have been googling and googling, looking through the professor's notes and I just could not get it. (I missed our last class) You have been a tremendous help to me. Thank you so so much! I would not have learned it without you.
I just wanted to thank you for two of your videos (I have only watched two so far)-- I am taking discrete math and found them to be of great value and really help me apply and understand the course material
dude it seems like you're saving all my IT journey through college not only calculus and linear algebra.. thanks a lot you resolved a lot of confusion surrounding this stuff
Thank you very much, it really cleared my doubt for Euler path and Euler circuit.The example was nice too..it cleared difference between Euler path and Euler circuit.Much respects and love from India.
wow thank you sooo much im in fifth grade n i had to know this but i missed my class because i had to go to gate class but this video got me right back on track so thank 10000000 times if thats a number
An Euler circuit uses every edge exactly once and ends at the vertex on which it started; a Hamiltonian circuit uses every vertex exactly once and ends at the vertex on which it started.
@Madgod112 yep, i plan on doing a bunch more graph theory stuff, but it will be slow going for a while still as i am trying to crank out a bunch of trig stuff
@naileaflower7 it's simply how much edges the vertice makes like if you drew a dot and make an 'x' by drawing lines,that has 4 degree so simply how much edges or curves it makes...
Guys remember just like the video and read this comment. A graph is eulerian (euler cycle) when there is all even degrees. A graph is semi - euler (open uelarian) when there is 2 odd degrees.
In terms of stoplights at the 4 main intersections, I think the optimum euler circuit (being the most efficient from a postal worker's perspective) would be one which involves just two left hand turns right? I don't see any with less than that. Forgive me if that has nothing to do with graph theory.. it's just something I saw on myth busters :)
i thought trails and paths differ in definition. Trails are walks in which edges cannot be repeated and paths are walks in which vertices cannot be repeated
They don't differentiate Euler path and Euler circuit in my disc math lecture. What you described to be Euler circuit was just another criteria for an Euler path to exist!
This was great, but now I have no idea how to get to the second part of the video where you explain how to find the paths.
Remember this: for there to be an Euler Path, there has to be 0 or 2 vertices with an odd degree, with the degree being the number of lines leading to that vertice and every other vertex degree has to be an even number because the path you are going on will start on the odd-degree vertex (if there is one) touch that vertex and go away. At some point, you will touch the starting point and the ending point (which is also an odd-degree vertex, if there is one).
ive learned more in 10 minutes here about eularian paths and circuits than in 1 month in my math class, thank u sir
my pleasure!
Seriously, you have no idea how much your videos have helped me over the years. They helped me in high school, now they're supplements for my college lectures. Thank you so much.
Wonderful explanation. This helped a lot in reviewing the material for my discrete math class.
To have an Euler Circuit, for every edge going "out" you need to have an edge going "in", thus an even degree for each vertex.
For a path, the minimum condition is an additional edge after completing a circuit, creating two vertices with odd degrees.
U R JUST THE BEST TEACHER I HAVE EVER SEEN.THANK YOU FOR EVERYTHİNG.I LOVE YOU MAN.
I hate this crap so much. It’s super confusing, but I’m glad there are ppl like you that take their time and explain to help ppl pass their class
Bless your heart!!!!!!! I have a test tomorrow afternoon and I have been googling and googling, looking through the professor's notes and I just could not get it. (I missed our last class) You have been a tremendous help to me. Thank you so so much! I would not have learned it without you.
I just wanted to thank you for two of your videos (I have only watched two so far)-- I am taking discrete math and found them to be of great value and really help me apply and understand the course material
@motarski no problem, you are very welcome
I wish you were my discrete math teacher...=(
After 11 years here I'm learning Euler paths for my final project. Hats off
dude it seems like you're saving all my IT journey through college not only calculus and linear algebra.. thanks a lot you resolved a lot of confusion surrounding this stuff
I am IT student I want to tell you that because of you I get full mark in my mid term exam so thank you very much
Super helpful!!!! I was so sad my professor just doesn't know how to teach! Thank you so much!!!
This is so clearly explained, thank you! Did you ever make the video on finding Euler paths/circuits?
you are very welcome!
Completely understood everything
if only all my math teachers would have been as good as you i would be a genius by now
i was about to fail my first topology exam, but your video really saved me, thank you so much!
good luck in the course! topology is super interesting stuff
Best explanation so far - Tomorrow I pumped for the exam!
If Carlsberg made discrete maths vids, they wouldn't even come close.
Genius mate. Well done.
Thank you very much, it really cleared my doubt for Euler path and Euler circuit.The example was nice too..it cleared difference between Euler path and Euler circuit.Much respects and love from India.
thank able to see it function made more sense than trying to read and comprehend out of the book.
Tq so much, ur explanation is better than my lecturer's explanation
Thanks a lot ! You taught in a way I understood, better than my tutors. Haha. Good job.
Akbar Azad 2 day lecture by my prof doing all proof and crap trying to explain this stuff, and this guy taught it in 10 mins.
wtf college
your helping me study for my final right now...i love this!
Tomorrow r my xms,this helped me a lot .Thanx !
how was your exam 6 years ago ha ha ha
Thank you so much you gave me a better understand of the significance of euler paths.
I really enjoy your videos, this makes learning fun.
wow thank you sooo much im in fifth grade n i had to know this but i missed my class because i had to go to gate class but this video got me right back on track so thank 10000000 times if thats a number
I am THRILLED to see patrickJMT's videos for Euler circuits & paths! Actually, ANY math related videos of yours helps me tremendously! Thank you!
This helped me a lot with my Discrete Math homework. Kudos!
awesome video, 5 stars for teaching!
Thanks for the crystal clear explanation
The second problem is the "Chinese Postman Problem". Good explanation :)
I love this,it explains the concepts clearly using drawings, thank you!
a simple and understandable explanation
glad it helped :)
Awesome explained sir
I thought it was euler (you-ler) but (oil-ler) sounds great LOL love it man.
OMG!!! thank you so much! my teacher make it so complicated, but now its all good thank you man..
Thank you for the thorough explanation, helped me a lot!
i really like all this videos! all of them are very useful.thank you so much !!!
thanks, they asked a question similar to that last part on my exam, glad i checked this videos
An Euler circuit uses every edge exactly once and ends at the vertex on which it started; a Hamiltonian circuit uses every vertex exactly once and ends at the vertex on which it started.
@rogybra i am not sure what you mean
Thanks for posting this this will help me for class!
Made it so easy to understand. Thanks!
@sanjor8r nope. i take requests from me only : )
I apreciate so much what you do!
Best wishes!
ohhh.. i see the porpose of your tutorial thats good for all person that they want to learned about euler circuit and euler path
@Henry92RLC yes, i have 3, just do a search on my videos of 'induction'
@Madgod112 yep, i plan on doing a bunch more graph theory stuff, but it will be slow going for a while still as i am trying to crank out a bunch of trig stuff
@ileacristian thanks : )
where's the link to part 2?
@thespurginator ha, well, of the 35000 subscribers, i guess i have to be on the same page with at least a few of them : )
I have watch most of your videos, and I-realized how stupid I am for not finding ur channel sooner.
Helps a lot ! Thank .!
Hope i will do good in my discrete mathematics final exam
this really helped my daughter. i know i couldn't explain it! lol. subscribed.
Awesome. great explanantion! Test tomorrow! thank you!.
thanks so much this helped me so so much!!!!
You are the King!
This is amazing
Thank you...very helpful video !
Thanks! This helped me so much!
Very good and very useful. Put a number on each video to make a set.
Thank you sir
thank you i got a clear understanding on this subject
@naileaflower7 it's simply how much edges the vertice makes like if you drew a dot and make an 'x' by drawing lines,that has 4 degree so simply how much edges or curves it makes...
Really Cool. Keep up the good work.
nice work! ..keep it up!!!!
Thank you
Guys remember just like the video and read this comment.
A graph is eulerian (euler cycle) when there is all even degrees.
A graph is semi - euler (open uelarian) when there is 2 odd degrees.
Thank you very very much
God bless you.
In terms of stoplights at the 4 main intersections, I think the optimum euler circuit (being the most efficient from a postal worker's perspective) would be one which involves just two left hand turns right? I don't see any with less than that. Forgive me if that has nothing to do with graph theory.. it's just something I saw on myth busters :)
awesome tutorial
Glad you liked it
Thank you!!!!!!!!!!!!!!!!!!!!!!!!!
yup new favorite.
where is the next video where you explain how to make Euler circuit ?
simple and easy thank you so much ~
@patrickJMT looking forward to it :)
Thank you!!! You saved my math grade lol
@asorsuehtam no free pen advertisements here
Thank you for sharing. Really impressive.
A great engineer!
Yukai Zhong who are you referring?
Do you have any videos on Mathematical Induction? If not, can you make one before Friday? It would help a lot.
I thought the definition of a path was that it cannot go through a vertex more than once but in a euler's path you do touch the vertex more than once?
Great video!
great work!!
Can you do Hamiltonian Paths and reduce them to SAT
you really help me i school thanx !!!!!!!!!!
thanks! i now know how to deliver the mail correctly!
Very helpful. Thank you
Thanks alot, this was really helpful
i thought trails and paths differ in definition. Trails are walks in which edges cannot be repeated and paths are walks in which vertices cannot be repeated
They don't differentiate Euler path and Euler circuit in my disc math lecture. What you described to be Euler circuit was just another criteria for an Euler path to exist!
please do a video on hamiltonian circuits!
thank you mennn
Very helpful!
Thanks for the help! :)
Thank you....sir...it helps me lot