Graph Theory 4: Non-Planar Graphs & Kuratowski's Theorem

[@georgelaing2578]

It's nice to see someone taking time to discuss Kurtowski. It is usually just
mentioned in passing.

[@anoopjalla8404]

when you first drew the peterson subgraph, how did you know which edges to remove intially?

[@standalone8314]

You can try with any other points. The end diagram is the same. Note that the inner points are equivalent and outer points are also equivalent. So just check by removing any one of the outer points.

[@vector8310]

You clarified in under eleven minutes what canonical texts have universally obscured.

[@frankiezafe]

great video! it's perfect to finish my day!

[@willcussins5018]

shut up

[@merinsyriac9704]

Found this video helpful. Thank you

[@Busterblade20]

Thank you so much. I was having trouble with this concept really well explained.

[@autogenes]

How did he decide which vertices to delete from the Petersen to create K3,3?

[@autogenes]

great vid btw

[@migkillerphantom]

That's the tricky part.

[@franmesic5205]

The combination of a bit of luck and looking at what degree points are. Usually, you wanna keep 5 or 6 points with deg=3 or 4. In Peterson, they are all 3 so you choose at random

[@nimmi7526]

You can delete any actually. Then you gotta arrange it in the way to convert it into k5

[@valeriereid2337]

Brilliant! Thanks for explaining Kuratowski's Theorem.

[@acheacjun]

awesome videos, i finally understand kuratowski ;) thx man

[@SimpleLivingHigherThinking]

thank you for making the concepts so simple and fun !! 😀

[@user-es2xj7uv3w]

That was extremely helpful, thank you !

[@asutoshghanto3419]

thanks bro I hope you get more views

[@letslearncomputerscience2798]

thanks this video is not only and makes this concept lucid ...

[@LIFEOFSTUFFEDANIMALS]

writing backwards always amazes me great vid

[@dellokrd9916]

Bombastic Video + Explanation

[@aninditasaha5193]

Sir plz called the planner graph and non planner graph alpha index and gamma index calculation formula of transport network connectivity ??

[@JayPatel-xt9ug]

Thank you for explaining, Great video.

[@gem4994]

Very good video thanks ❤

[@mzakizadeh]

Wow that board is so cool :)

[@aleksandarsashev3270]

Good explanation, thank you !

[@SequinBrain]

Does every non-planar graph contain both forbidden Ks, or is Petersen idiosyncratic?

[@stanley289]

Great explanation ❤

[@shubhamsahu4324]

ek number bhai

[@diliniuthpala1802]

good job.clearly explained.

[@bryangonzales4145]

are you witting backward or the camera is just inverted

[@dinukaweerasooriya2365]

of course he is writing backwards

[@gunnerbutch8620]

Great video!!!

[@touseefhaider7014]

You are great.

[@jamestogher1098]

The initial vertex you remove on the inner star is of degree 3 is it not? I'm a little confused as to why you were able to do that, when you said previously the vertices had to be of degree 2.

[@alperkaya8919]

Great explanation

[@hidayahzainal1571]

very clear explanation. thank you.

[@匿名者-q6j]

What a wonderful lesson!!

[@oanphong61]

Thank you!! This helps me a lot!!

[@ayanaxhye]

awesome sauce

[@surajr1914]

Amazing video. Thank you :)

[@unoriginal9353]

why cant we simplify k33 even more?

[@sujuponnamma9899]

Good explanation

[@Akash-dd6ev]

Thank u so much sir!

[@renjinijayakumar2013]

Nice video. Thank you!!

[@aakashp485]

thank you very much for this video

[@0001-exe]

Thank you so much !!!!

[@밑에시간누르면광고없]

10:40

[@abdulkadermahi1594]

i recommend playing this at 1.5x

[@pablock0]

thanks!!!

[@daarionaharis1448]

Verygood

[@eaglei2505]

have my discrete math class exam tomorrow and i know am fucked if i get a question like this

[@sathyarajesh7787]

howd it go?

[@nguyenthaongan9667]

Perfect

[@Andy-gp8qy]

👍

[@diliniuthpala1802]

good job.clearly explained.

[@samakshbansal]

Great Video!!!