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 love these graph videos from a mathematical perspective. There are way more computer science/interview prep videos all over youtube that don't explain WHY an algorithm works or graph property exists and not enough videos like these. Definitely looking forward to your future videos with the proofs.
Haha, you always have a knack for covering topics that I just finished learning a month ago. Good video, though. It's also amusing to adapt Prim's to find the maximum spanning tree, and even minimum product spanning tree!
Thanks, David! Ah well, better than a year ago haha! I've been jonesing to do some more graph theory lately. Will definitely have more on spanning trees soon!
My pleasure, always glad to turn around requests quickly. I don't get to do it as much these days as I used to. A request was just what I needed to get back into some graph theory lessons!
Thanks, Devansh! I will keep you in mind when the time comes! And anyone watching this video with CS-related questions, I implore you to ask Devansh and not me! 😂
Please ... can you make video about the following question? (What I found at internet is : cardinality of real irrational numbers is equal to cardinality of real numbers so there must be bijection between them but I can't find it by myself or by internet) The question is what is the bijection between real irrational numbers and real numbers?
Thanks for watching and I am glad you're eager to know why it works - I think that's the best part! If you want it soon, I'll try to get it done soon - perhaps this weekend! We'll suppose for sake of contradiction that T, a spanning tree produced by Prim's algorithm, is not a minimum spanning tree - and proceed from there!
Show that height of the cylinder of greatest volume which can be inscribed in a right circular cone of height h and semi vertical angle α is one-third that of the cone and the greatest volume of cylinder is 4πh³tan²α/27. I just wanna know that how much do you rate this one out of 10 for difficulty?
I'm not sure! I'd have to go through the process of trying to solve it and actually solving it or seeing a solution to have an idea. But scales don't have meaning without context! So a 5 to me might be a 10 to someone with high school level math knowledge/experience, and a 10 to me might be a 5 to someone with more knowledge/skill. Certainly geometry, and 3d geometry, can be deceptively difficult!
Let T be a tree and e = (u, v) be an edge in T. Then beta(T.e) = beta(T. e),\\ beta(T)-1,\\ beta(T), otherwise. if both u and v are stem vertices; if one of u and v is a leaf and other one is minor stem; otherwise. Can you give me proof of this theorem??
![Seungmin "그렇게, 천천히, 우리(As we are)" | [Stray Kids : SKZ-PLAYER]](http://i.ytimg.com/vi/kAzmhLHePqU/mqdefault.jpg)
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 love these graph videos from a mathematical perspective. There are way more computer science/interview prep videos all over youtube that don't explain WHY an algorithm works or graph property exists and not enough videos like these. Definitely looking forward to your future videos with the proofs.
this is the best playlist for graph theory, thank you so much
That was the clearest explanation of the Prim 's algorithm I already had in my life! Thanks!
So glad to hear it! Thanks for watching!
Haha, you always have a knack for covering topics that I just finished learning a month ago. Good video, though. It's also amusing to adapt Prim's to find the maximum spanning tree, and even minimum product spanning tree!
Thanks, David! Ah well, better than a year ago haha! I've been jonesing to do some more graph theory lately. Will definitely have more on spanning trees soon!
thanks man for making a video on such a short time. Appreciate it
My pleasure, always glad to turn around requests quickly. I don't get to do it as much these days as I used to. A request was just what I needed to get back into some graph theory lessons!
Yes CS perspective for all related videos
thank you so much
My pleasure, thanks for your support! If you're looking for more graph theory, check out my playlist: ruclips.net/p/PLztBpqftvzxXBhbYxoaZJmnZF6AUQr1mH
I can help with the CS perspective
Thanks, Devansh! I will keep you in mind when the time comes! And anyone watching this video with CS-related questions, I implore you to ask Devansh and not me! 😂
Please ... can you make video about the following question?
(What I found at internet is : cardinality of real irrational numbers is equal to cardinality of real numbers
so there must be bijection between them but I can't find it by myself or by internet)
The question is
what is the bijection between real irrational numbers and real numbers?
Could you tell when the proof of this algorithm would be explained as i am interested to know why does it work?
Thanks for watching and I am glad you're eager to know why it works - I think that's the best part! If you want it soon, I'll try to get it done soon - perhaps this weekend! We'll suppose for sake of contradiction that T, a spanning tree produced by Prim's algorithm, is not a minimum spanning tree - and proceed from there!
@@WrathofMath thanks !! waiting to see the proof video
Anyone else wonder how things would have played out differently if Katniss hadn't volunteered?
Show that height of the cylinder of greatest volume which can be inscribed in a
right circular cone of height h and semi vertical angle α is one-third that of the
cone and the greatest volume of cylinder is
4πh³tan²α/27.
I just wanna know that how much do you rate this one out of 10 for difficulty?
I'm not sure! I'd have to go through the process of trying to solve it and actually solving it or seeing a solution to have an idea. But scales don't have meaning without context! So a 5 to me might be a 10 to someone with high school level math knowledge/experience, and a 10 to me might be a 5 to someone with more knowledge/skill. Certainly geometry, and 3d geometry, can be deceptively difficult!
Yeah. It is the fision of Geometry and diffrentiation. It is from chapter *Application of derivatives*
Let T be a tree and e = (u, v) be an edge in T. Then beta(T.e) = beta(T. e),\\ beta(T)-1,\\ beta(T), otherwise.
if both u and v are stem vertices; if one of u and v is a leaf and other one is minor stem; otherwise.
Can you give me proof of this theorem??