Support the production of this course by joining Wrath of Math as a Channel Member for exclusive and early videos, original music, and upcoming lecture notes for the graph theory series! Plus your comments will be highlighted for me so it is more likely I'll answer your questions! ruclips.net/channel/UCyEKvaxi8mt9FMc62MHcliwjoin Graph Theory course: ruclips.net/p/PLztBpqftvzxXBhbYxoaZJmnZF6AUQr1mH Graph Theory exercises: ruclips.net/p/PLztBpqftvzxXtYASoshtU3yEKqEmo1o1L
I sit in class feeling like a failure for not being able to understand this stuff, and then you clear up the topic nearly every time. Your series on graph theory have been an absolute savior. You are so good at describing these concepts, I wouldn't be surprised if you used a teleprompter! Such elegant explanations.
exams are in a week. This channel helped me a lot. Especially when my teacher made all of discrete math seem so complicated when it was just this simple and understandable. Thanks a lot man.
Thanks for watching! I agree - they're really awesome and the proofs that follow this in my graph theory playlist are a bunch of fun as well! ruclips.net/p/PLztBpqftvzxXBhbYxoaZJmnZF6AUQr1mH
wow ! why werent you my TA in school for the Graph Theory course ! loved your video this is absolutely awesome. BTW - How is it possible to draw K33 on a coffee cup , wouldnt I still end up crossing the final edge ? ( or am I doing something goofy like .. drawing over the handle of the cup ?)
Thanks a lot! So glad the lessons are helpful, and if you haven't already be sure to check out my Graph Theory playlist: ruclips.net/p/PLztBpqftvzxXBhbYxoaZJmnZF6AUQr1mH As for drawing K33, as you can imagine that is difficult to answer in text. Check out this video, around 13:20 I think: ruclips.net/video/VvCytJvd4H0/видео.html If you were not able to do it, it would be because you're NOT doing something goofy like drawing over the handle - drawing over the handle is the key since it allows you to effectively make one edge jump right over another - pretty slick!
Do you have any interest in graceful graphs? If so, I suggest a video on the classes which have been proven graceful. I haven't dug into those proofs myself, but I assume they're difficult. However, many classes have been proven by construction, or in other words, an algorithm for labeling the vertices. That makes it easy to demonstrate the algorithm on examples, even if the formal proof is too difficult to explain. Just another thought. As always, take it or leave it. Keep enjoying the math and stay swanky!
I have studied up on graceful graphs a little bit, they might be fun to talk about after finishing this week’s marathon of planar graph videos! Once all is said and done, and I take the countless hours to sort my playlist, we will have a very excessive first course in graph theory playlist! What I recall from my last readings on graceful graphs, is thinking “boy, this stuff could be clunky to explain” haha, but I haven’t thought that much about presenting the material, so it might be no problem with some practice! Really appreciate the great ideas! They’re all in my notes, and they’ll be coming down the pipe! Thanks for the support, and may we all stay swanky in these difficult times!
My pleasure! Thanks for watching and good luck on your exam! If you're looking for more graph theory, check out my playlist: ruclips.net/p/PLztBpqftvzxXBhbYxoaZJmnZF6AUQr1mH
I was looking at a couple of graph theory primers, and they both started with geographic areas. They mentioned the edges couldn't cross. What I want to know is Why the edges can't cross. What am I missing?
Thanks for watching and that is perhaps a result of the context in which graphs were introduced in those primers. I couldn't tell you for sure without seeing them though. When we represent maps of geographic areas with graphs, we typically represent regions of the map by vertices, and join vertices if their corresponding regions share a border. Drawing a graph from a map in this manner will result in a graph with no edge crossings (so long as you draw it with some care), and a major area of study in graph theory is that of planar graphs, which are graphs that can be drawn in the plane with no edge crossings. Outside of this context (and perhaps some others I am forgetting/am unaware of), edge crossings are not especially important. We can draw a graph with or without edge crossings, it doesn't change what the graph is - a set of vertices and a set of edges consisting of two-element subsets of the vertex set. See my lesson "What is a Graph?" for that definition if you're not familiar with it. And if you haven't already, check out my graph theory playlist! ruclips.net/p/PLztBpqftvzxXBhbYxoaZJmnZF6AUQr1mH
Glad to hear it! Thanks a lot for watching, and if you're looking for more graph theory, check out my graph theory playlist! ruclips.net/p/PLztBpqftvzxXBhbYxoaZJmnZF6AUQr1mH Let me know if you ever have any requests!
Thank you, I am glad it was helpful! If you haven't already, check out my graph theory playlist for more! ruclips.net/p/PLztBpqftvzxXBhbYxoaZJmnZF6AUQr1mH
Support the production of this course by joining Wrath of Math as a Channel Member for exclusive and early videos, original music, and upcoming lecture notes for the graph theory series! Plus your comments will be highlighted for me so it is more likely I'll answer your questions!
ruclips.net/channel/UCyEKvaxi8mt9FMc62MHcliwjoin
Graph Theory course: ruclips.net/p/PLztBpqftvzxXBhbYxoaZJmnZF6AUQr1mH
Graph Theory exercises: ruclips.net/p/PLztBpqftvzxXtYASoshtU3yEKqEmo1o1L
I sit in class feeling like a failure for not being able to understand this stuff, and then you clear up the topic nearly every time. Your series on graph theory have been an absolute savior. You are so good at describing these concepts, I wouldn't be surprised if you used a teleprompter! Such elegant explanations.
Thank you so much!
exams are in a week. This channel helped me a lot. Especially when my teacher made all of discrete math seem so complicated when it was just this simple and understandable. Thanks a lot man.
I'm so glad my lessons helped, thanks a lot for watching and best of luck on the exams!
Hey how'd your exams go?
@@PunmasterSTP i passed. went better than i had hoped for lol.
@@lucassilva7194 I’m really glad to hear that!
This video came out a few days after my discrete math final lol I needed this
Sorry it was late haha! But thanks for watching and it's good to be talking about planar graphs at last!
Oh man, sorry! How'd the class and the final go?
jeeeeeez, the two moments you came up with EulerIdentity and examples of non-planar are just amaaaaaaaaazing!!! How interesting they are woah!
Thanks for watching! I agree - they're really awesome and the proofs that follow this in my graph theory playlist are a bunch of fun as well! ruclips.net/p/PLztBpqftvzxXBhbYxoaZJmnZF6AUQr1mH
wow ! why werent you my TA in school for the Graph Theory course ! loved your video this is absolutely awesome. BTW - How is it possible to draw K33 on a coffee cup , wouldnt I still end up crossing the final edge ? ( or am I doing something goofy like .. drawing over the handle of the cup ?)
Thanks a lot! So glad the lessons are helpful, and if you haven't already be sure to check out my Graph Theory playlist: ruclips.net/p/PLztBpqftvzxXBhbYxoaZJmnZF6AUQr1mH
As for drawing K33, as you can imagine that is difficult to answer in text. Check out this video, around 13:20 I think: ruclips.net/video/VvCytJvd4H0/видео.html
If you were not able to do it, it would be because you're NOT doing something goofy like drawing over the handle - drawing over the handle is the key since it allows you to effectively make one edge jump right over another - pretty slick!
You are a great great person. Thank you
It's plane to see: your channel's awesome! 👍
Your teaching methods are good and I am from India
Thank you!
Do you have any interest in graceful graphs? If so, I suggest a video on the classes which have been proven graceful. I haven't dug into those proofs myself, but I assume they're difficult. However, many classes have been proven by construction, or in other words, an algorithm for labeling the vertices. That makes it easy to demonstrate the algorithm on examples, even if the formal proof is too difficult to explain. Just another thought. As always, take it or leave it. Keep enjoying the math and stay swanky!
I have studied up on graceful graphs a little bit, they might be fun to talk about after finishing this week’s marathon of planar graph videos! Once all is said and done, and I take the countless hours to sort my playlist, we will have a very excessive first course in graph theory playlist! What I recall from my last readings on graceful graphs, is thinking “boy, this stuff could be clunky to explain” haha, but I haven’t thought that much about presenting the material, so it might be no problem with some practice! Really appreciate the great ideas! They’re all in my notes, and they’ll be coming down the pipe! Thanks for the support, and may we all stay swanky in these difficult times!
@@WrathofMath lol
The vertices of same color should be adjacent or should not?
You just saved my assignment's life, Thank you!
Glad to help, thanks for watching!
Thank you so much! I have an exam tomorrow and you are a life saver!
My pleasure! Thanks for watching and good luck on your exam! If you're looking for more graph theory, check out my playlist: ruclips.net/p/PLztBpqftvzxXBhbYxoaZJmnZF6AUQr1mH
I know it's been a few years, but how did your exam go?
your explanation is amazing!!!!!!. thankyou so much sir.
Most welcome!
Great presentation!
Thank you kindly!
The best maths teacher exists 🙌
Hello sir, please explain weakly modular graphs and its properties
!
Wow nice explanation.. ❤️
Thank you very much
Glad to help - thanks for watching!
Please explain Cage- amalgamation graph, how we cane find it?
thanks
well explained :)
Thank you!
can we use euler formula to prove a graph is plannar?
That outro is 🔥, gives vibes of math researcher playing key role in ww3 winning lmaoo
Hahaha thank you!
Interesting thing about thus topic is that any nonplaner graph , Must containe any of K3,3 or K5 or both....
Indeed, it's a very surprising result!
I was looking at a couple of graph theory primers, and they both started with geographic areas. They mentioned the edges couldn't cross. What I want to know is Why the edges can't cross. What am I missing?
Thanks for watching and that is perhaps a result of the context in which graphs were introduced in those primers. I couldn't tell you for sure without seeing them though. When we represent maps of geographic areas with graphs, we typically represent regions of the map by vertices, and join vertices if their corresponding regions share a border. Drawing a graph from a map in this manner will result in a graph with no edge crossings (so long as you draw it with some care), and a major area of study in graph theory is that of planar graphs, which are graphs that can be drawn in the plane with no edge crossings. Outside of this context (and perhaps some others I am forgetting/am unaware of), edge crossings are not especially important. We can draw a graph with or without edge crossings, it doesn't change what the graph is - a set of vertices and a set of edges consisting of two-element subsets of the vertex set. See my lesson "What is a Graph?" for that definition if you're not familiar with it. And if you haven't already, check out my graph theory playlist! ruclips.net/p/PLztBpqftvzxXBhbYxoaZJmnZF6AUQr1mH
very very informative
Glad to hear it! Thanks a lot for watching, and if you're looking for more graph theory, check out my graph theory playlist! ruclips.net/p/PLztBpqftvzxXBhbYxoaZJmnZF6AUQr1mH
Let me know if you ever have any requests!
Thamkyou
My pleasure! Thanks for watching and check out my graph theory playlist for more! ruclips.net/p/PLztBpqftvzxXBhbYxoaZJmnZF6AUQr1mH
Superb
Thank you, I am glad it was helpful! If you haven't already, check out my graph theory playlist for more! ruclips.net/p/PLztBpqftvzxXBhbYxoaZJmnZF6AUQr1mH
Thank you
My pleasure, thanks for watching!
#Excelent!
Super
Thank you!
U R SO (good)^2 !
Thank you!
Idea: Take a simple proof and complexify it so much
Uff so relatable 😂
You look like a slightly nerdier Will wood
Grateful for the slightly
you look like logic
Haha, maybe a little! Thanks for watching, and if you like rap, check out my math rap channel! ruclips.net/channel/UCQ2UBhg5nwWCL2aPC7_IpDQ