Euler Circuits and Euler Paths

[@DONTSLAM]

U R JUST THE BEST TEACHER I HAVE EVER SEEN.THANK YOU FOR EVERYTHİNG.I LOVE YOU MAN.

[@AleksandrStrizhevskiy]

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.

[@yutangxie8593]

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).

[@fireflies15]

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

[@cherrysweet5492]

Super helpful!!!! I was so sad my professor just doesn't know how to teach! Thank you so much!!!

[@notniteyet]

This is so clearly explained, thank you! Did you ever make the video on finding Euler paths/circuits?

[@ynes1988]

Thank you so much you gave me a better understand of the significance of euler paths.

[@CBrown2392]

This helped me a lot with my Discrete Math homework. Kudos!

[@akbarazad93]

Thanks a lot ! You taught in a way I understood, better than my tutors. Haha. Good job.

[@thepenmen22]

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

[@DonaldMurf]

awesome video, 5 stars for teaching!

[@arnelpapauran9225]

ohhh.. i see the porpose of your tutorial thats good for all person that they want to learned about euler circuit and euler path

[@patrickjmt]

@sanjor8r nope. i take requests from me only : )

[@CitizenLM]

Thank you for the thorough explanation, helped me a lot!

[@Iteekapur12]

Made it so easy to understand. Thanks!

[@stevenhawking3637]

Really Cool. Keep up the good work.

[@alliedaniels]

Thank you!!! You saved my math grade lol

[@piyasb]

Thank you...very helpful video !

[@muhammadirfankhan7340]

where's the link to part 2?

[@Ihatenicknames1]

Thanks for the help! :)

[@future2begood]

by the way nice video. really appreciate

[@shadowlegion3115]

I wonder if a path can repeat vertices, cuz path is supposed to be a walk that doesn’t repeat any vertex twice right?

[@Banefane]

awesome:)!

[@arjityadavv]

thanks man!! :) :D

[@rsota2222]

Wow!

[@BaconOtaku]

Can you do some on Hamiltonian cycles?

[@teejaybradford4517]

Zeta, x and y?

[@dinodinos4240]

lol this guy said they are cities and streets connecting them 😂😂 dunbo thats not what a street is

[@thesun9729]

you are very young to watch this video

[@bundokman]

I wish you were my discrete math teacher...=(

[@gabrielmeza812]

ive learned more in 10 minutes here about eularian paths and circuits than in 1 month in my math class, thank u sir

[@patrickjmt]

my pleasure!

[@patrickjmt]

@thespurginator ha, well, of the 35000 subscribers, i guess i have to be on the same page with at least a few of them : )

[@levizraelit5557]

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.

[@patrickjmt]

@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

[@patrickjmt]

@Henry92RLC yes, i have 3, just do a search on my videos of 'induction'

[@patrickjmt]

@asorsuehtam no free pen advertisements here

[@patrickjmt]

@rogybra i am not sure what you mean

[@xander7b]

where is the next video where you explain how to make Euler circuit ?

[@patrickjmt]

@motarski no problem, you are very welcome

[@patrickjmt]

you are very welcome!

[@levelovixor]

Completely understood everything if only all my math teachers would have been as good as you i would be a genius by now

[@patrickjmt]

@ileacristian thanks : )

[@Minglator]

Can you do Hamiltonian Paths and reduce them to SAT

[@bluealpha8410]

I have watch most of your videos, and I-realized how stupid I am for not finding ur channel sooner.

[@daman0015]

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

[@amritsohal7886]

I thought it was euler (you-ler) but (oil-ler) sounds great LOL love it man.

[@patrickjmt]

glad it helped :)

[@idresidres4302]

Hi Q) If G1 is r1-regular and G2 is r2-regular , G1+G2 is Euler circuits or not .

[@kevinlabore1726]

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

[@shehab5781]

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?

[@kimberlysouthern5354]

I am THRILLED to see patrickJMT's videos for Euler circuits & paths! Actually, ANY math related videos of yours helps me tremendously! Thank you!

[@sjsawyer]

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 :)

[@brittanymillerrocks]

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

[@trojanhorse2029]

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.

[@Postcalculus]

Patrick, you cheated at 7:44. You simply lifted your pen and went to colour around the block in the centre! That means you traversed the peripheral road not twice, but 3 times!!

[@7coldfusion]

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!

[@trojanhorse2029]

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.

[@omkars764]

Come to learn from the videos. Come to enjoy the handwriting.

[@kaushikdr]

WHY does having an even degree imply Euler cycles/circuits? You asked the question but you never proved it XD

[@sree8708]

Any real life example for Euler graph something new example

[@rudyrodriguez8143]

I swear all the closed captioning is done by a drunken ape listening to the audio through a three foot concrete wall. No offense to the video, youtube CC is always just hilariously bad.

[@Henry92RLC]

Do you have any videos on Mathematical Induction? If not, can you make one before Friday? It would help a lot.

[@GoodNewsForStrangers]

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.

[@mattrew2]

so what's the difference between the euler path/circuit and the Hamiltonian path/circuit, respectively??

[@imcoolrivera]

what happens if an euler path is not tracable but it has the right degrees to make it an euler path??!

[@SusannaJ]

u must really liek math to be putting up all these vids!! thank you tho they are really helpful

[@ilyn2208]

@asorsuehtam it is sharpie.. it is a really good pen .... it comes in different colors too;)

[@volo7]

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

[@thepenmen22]

i know u said that all even and 2 or more odd degrees is poeeible, but is it possible to have all even degrees, but only 1 odd?

[@volkanalcin7792]

+thepenmen22 I really like this page, explains all the conditions www.ctl.ua.edu/math103/euler/howcanwe.htm

[@letsroll2463]

my teacher pronounces this as ewwuulurrrr, but english is my teachers 2nd language so sometimes im not too sure lol

[@jeffrey8770]

+letsroll Oiler is the correct pronunciation apparently...

[@pwnzar121]

+Jeffrey Li Euler is a Swiss name which is why it's pronounced that way

[@MrMayoyama]

Could you add hamilonian path/circuits to the end of this or as another topic?

[@nenorota]

sorry , what is the deference between Euler Cycle and Hamiltonian Cycle ?!

[@Stichting_NoFa-p]

is it only a path if there are 2 vertices of 3, or also when there are 4 or more?

[@hammadsheikh4807]

After 11 years here I'm learning Euler paths for my final project. Hats off

[@tushart.sonwane9639]

I really enjoy your videos, this makes learning fun.

[@jysc9062]

Tq so much, ur explanation is better than my lecturer's explanation

[@samauman8318]

thanks so much this helped me so so much!!!!

[@JohnCollinsPalmer]

please do a video on hamiltonian circuits!

[@thespurginator]

how do you do this, for the longest time you published videos dealing with exactly what i was covering in calculus at the time. now you do the subjects I'm learning in discrete math?

[@manuchoudhary9742]

no sir multigraphs didn't allow loops its pseudograph who does .

[@nazreidlover911]

Thanks! This helped me so much!

[@btkw]

hey put these graph theory videos in one playlist pls

[@MasterGlam]

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.

[@videogamer459]

@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...

[@shirleyalicegodfrey4235]

thank able to see it function made more sense than trying to read and comprehend out of the book.

[@BesteOzcaglar]

i really like all this videos! all of them are very useful.thank you so much !!!

[@future2begood]

Ah really? what you mean by no idea? if you that sympathy why don't you pay some money towards his paypal account. that would be really help. have u ever done that?

[@mrhaha8013]

Anyone coming from LC 753 ?

[@SKTWoodDesign]

Best explanation so far - Tomorrow I pumped for the exam!

[@soltified]

You are left hander

[@tanvirmahtab5931]

No Euler's path and circuit for directed graphs?

[@udennyn]

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.

[@brittanymillerrocks]

at 9:22 it looks like a pretty picture :)

[@blair9633]

THERE IS NO USE FOR THIS STUFF!!! Please show me an example that has ACTUAL MEANINGFUL USE!!!!!

[@blair9633]

Vidit Vora .... Well, I'm a dumb person, unlike u..... So...Idk where I'm goin with this...

[@joker28666]

just because something is complicated doesnt mean its redundant, i know for a fact i wont use derivatives or integrals in the form that they were taught to me in my life, but for scientists, and certain computer programmers, where you would have to calculate some complex things, these things will be neccesary

[@blair9633]

joker28666 Cool k I cant see myself ever using this... but cool

[@rozakhalifa]

can you please explain hamiltonian circuits and how to find it mathematically not just by count vertices

[@rozakhalifa]

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

[@collinyan3638]

I think you are talking about Euler trail not Euler path because the path can only visit a vertex only once.

[@amancasula9408]

No

[@YourGPSForSuccess]

this really helped my daughter. i know i couldn't explain it! lol. subscribed.

[@andreischannel4594]

Thank you!!!!!!!!!!!!!!!!!!!!!!!!!

[@AloeVerafied]

Thought that multigraphs can't contain loops?

[@twofaces4410]

Awesome explained sir

[@systematictrader]

a path is meant to not include a vertex more than once, so why do your Euler 'path' go over so many vertices more than once?

[@systematictrader]

I figure you've mixed up your terminology (path trail) and (cycle cycle)