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! th-cam.com/channels/yEKvaxi8mt9FMc62MHcliw.htmljoin Graph Theory course: th-cam.com/play/PLztBpqftvzxXBhbYxoaZJmnZF6AUQr1mH.html Graph Theory exercises: th-cam.com/play/PLztBpqftvzxXtYASoshtU3yEKqEmo1o1L.html
Pro tip. When attempting to determine whether a graph is bipartite or not, if two vertices are connected by an edge, due to the definition of a bipartite graph, these two vertices have to be in different sets, and thus, you can colour code them differently. Continue this trend through the graph. If you find a contradiction where two vertices that are connected by an edge are of the same colour, then the graph is not a bipartite graph. Similarly, the opposite can be said to claim that a graph is bipartite.
Wow. Thanks for making this so clear. I thought I was missing something in how you can 'see' that a graph is bipartite. I could do that, but seeing it drawn out as two disjoint sets made it easier to grasp conceptually.
It is my pleasure, thanks for watching! If you're looking for more graph theory, be sure to check out my graph theory playlist! th-cam.com/play/PLztBpqftvzxXBhbYxoaZJmnZF6AUQr1mH.html
Ooo, this would be a fun puzzle to solve for a D&D campaign! I am so going to mention this to my DM. We're a group of computer scientists and physicists. Definitely our kind of fun.
Excellent as usual. Could you also compose a video on the Bipartite Theorem, i.e. "graph is bipartite iff there are no odd cycles". Whilst the first part is straight forward, I find the second part of this theorem somewhat difficult to visualise/understand, i.e. proving that if there are no odd cycles, then graph is bipartite. Just a thought!
So glad to hear it, thanks for watching! If you're looking for more graph theory, check out my playlist: th-cam.com/play/PLztBpqftvzxXBhbYxoaZJmnZF6AUQr1mH.html
I have a labeled Bipartite graph G = ( V, E ), V = (X,Y), i need to perform clustering on X based on the E(labels). Which algorithm can be used. Could you suggest some resources.
Thanks for watching, Kai! So glad it helped, and if you're looking for more graph theory - check out my graph theory playlist: th-cam.com/play/PLztBpqftvzxXBhbYxoaZJmnZF6AUQr1mH.html
Haha, thank you! Let me know if you have any questions and check out my graph theory playlist for more! th-cam.com/play/PLztBpqftvzxXBhbYxoaZJmnZF6AUQr1mH.html
Hello. In the case that we're presented with an unlabeled graph as in the last example, how would you determine how to label the graph to check if it is bipartite? Thank you!
Thanks for the question, and it depends! Do you mean labeled bipartite graphs? If so, the problem has a fairly straightforward solution, which I may do a lesson on soon. If you asking about unlabeled bipartite graphs (so we would be counting the bipartite graphs that are distinct up to isomorphism), the problem is a good deal more tricky, and I am not sure if there is such a nice formula for it.
Thanks for watching! No need to be scared, - with your mind, pencil, paper, and the entire internet and textbooks at your feet! You will know all you need! Check out my playlist if you're looking for more graph theory! Good luck! th-cam.com/play/PLztBpqftvzxXBhbYxoaZJmnZF6AUQr1mH.html
My pleasure, thanks for watching! If you're looking for more graph theory, check out my graph theory playlist: th-cam.com/play/PLztBpqftvzxXBhbYxoaZJmnZF6AUQr1mH.html Many more lessons coming and let me know if you have any video requests!
Thanks for watching and for the question, Sophie! Are you wondering about particular graphs of interest - like the Petersen Graph, or are you wondering about classic families of graphs - like Bipartite graphs, cycles, trees, and so on?
@@WrathofMath Thank you for your reply! I'm a CS student and bipartite is a graph that we discuss a lot in the discrete math and have a lot of interesting applications in the real world. I'm wondering if there are other classic graphs that are similar to bipartite in the sense that they have very interesting properties having real-world applications. Thank you!
Thanks for watching and for the question! Assuming that by null you mean "no edges", then you can easily answer that question for yourself with this theorem: th-cam.com/video/_TIqhvDR8DQ/w-d-xo.html
Glad to help! Let me know if you have any questions, and check out my playlist if you're looking for more! th-cam.com/play/PLztBpqftvzxXBhbYxoaZJmnZF6AUQr1mH.html
Hey I know that one way to determine if a graph is bipartite is by making sure its chromatic number is 2; but I also want to know how to do it by hand. In that case, how do I know how to EXACTLY partition the vertex sets? Also, I have a question; th-cam.com/video/TVHL7elNm9s/w-d-xo.html --> When I coloured the second graph in this video, it didn't have a chromatic number of 2. Could someone please explain?
Thank you for watching! The song is called "Turn Over" and it is by me. There is no full version anywhere, but there is a link to my inactive music channel in the description if that interests you!
Thank for watching, Kevin, and I really appreciate the consideration! Here is the link to PayPal for a one time donation: www.paypal.com/donate/?token=g1RCzmhS9oEgv5e72TMhb85ixTba-jQznf2elAcIdevLFsoM6SFpvaFRoOV9C3TQatAA0G&country.x=US&locale.x=US And here is a link to Patreon for monthly donations: www.patreon.com/join/wrathofmathlessons#no_universal_links Any and all donations are very appreciated, and I’ll continue to provide the best lessons I can!
Glad things turned around! Thanks for watching and if you're looking for more graph theory, check out my playlist! th-cam.com/play/PLztBpqftvzxXBhbYxoaZJmnZF6AUQr1mH.html
![ตีสิบเดย์ [FULL] | เปิดใจ "อาจารย์ เบียร์ ฅนตื่นธรรม" นักสนทนาธรรมสายดุดัน!](http://i.ytimg.com/vi/vqaBI_mnoDk/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!
th-cam.com/channels/yEKvaxi8mt9FMc62MHcliw.htmljoin
Graph Theory course: th-cam.com/play/PLztBpqftvzxXBhbYxoaZJmnZF6AUQr1mH.html
Graph Theory exercises: th-cam.com/play/PLztBpqftvzxXtYASoshtU3yEKqEmo1o1L.html
Pro tip. When attempting to determine whether a graph is bipartite or not, if two vertices are connected by an edge, due to the definition of a bipartite graph, these two vertices have to be in different sets, and thus, you can colour code them differently. Continue this trend through the graph. If you find a contradiction where two vertices that are connected by an edge are of the same colour, then the graph is not a bipartite graph. Similarly, the opposite can be said to claim that a graph is bipartite.
Thanks for watching and great comment, that's definitely the fastest way I can imagine doing it by hand!
wew! nais vro
I usually never comment on anything. But your trick works like "magic". It is really funny how fast you can determine what a bipartite graph is!
legend, thank you for sharing this
I can't picture this in my head unfortunately. I don't understand this tip at all
Those must be some pretty wild and exciting Saturday evenings you must have...
The wildest!
Wow. Thanks for making this so clear. I thought I was missing something in how you can 'see' that a graph is bipartite. I could do that, but seeing it drawn out as two disjoint sets made it easier to grasp conceptually.
Thanks a lot for watching, I am so glad it helped!
Thanks, this explanation was way better than my professor’s one!
High quality way to present information! Thank you!
Thanks for watching!
Dear sir, thank you so much for teaching me this hard subject in a very understandable way..please keep it up!
It is my pleasure, thanks for watching! If you're looking for more graph theory, be sure to check out my graph theory playlist! th-cam.com/play/PLztBpqftvzxXBhbYxoaZJmnZF6AUQr1mH.html
amazing no one could have described in a more better and understanding way
So glad to help and thanks for watching! :)
Thanks for another amazing video explaining a crucial part of graph theory! It is really helpful to me!😀
Awesome, thanks for watching!
Ooo, this would be a fun puzzle to solve for a D&D campaign! I am so going to mention this to my DM. We're a group of computer scientists and physicists. Definitely our kind of fun.
Sounds like it'd be a wonderful Saturday evening!
Oh now I understood this topic.. :-)
Glad to hear, thanks for watching!
challenging your friends to solve a bipartite graph. you absolute madlad ;^)
People always tell me I know how to have a good time!
Perfect explanation thenk you, exam...saved
Thank you, I am glad it helped!
appreciative explanation sir
Excellent as usual. Could you also compose a video on the Bipartite Theorem, i.e. "graph is bipartite iff there are no odd cycles". Whilst the first part is straight forward, I find the second part of this theorem somewhat difficult to visualise/understand, i.e. proving that if there are no odd cycles, then graph is bipartite. Just a thought!
Thank you! That is a great suggestion, I'm on it!
Here is the proof video! It was good fun, thanks for the request! th-cam.com/video/_TIqhvDR8DQ/w-d-xo.html
Thank u soo much for explaining so well, love and Repect from Pakistan
You're very welcome, I am glad it helped and thanks for watching!
amazing explanation
Sir..So in bipartite graphs is it not necessary to a one edge from the one set should connect to every edge from the other set?
If l, m and n are integers such that
0< l
Graphs on a Saturday? Sounds like a plan!! ;)
The best plan!
The best explanation.thanks.
I'm glad it helped, thanks for watching!
thank you a lot man, this helped me a lot
You're very welcome, I am glad it helped!
This was so useful. Thanks!
Glad to hear it, you're welcome and thanks for watching!
Thank you so much! I finally understand them!
So glad to hear it, thanks for watching! If you're looking for more graph theory, check out my playlist: th-cam.com/play/PLztBpqftvzxXBhbYxoaZJmnZF6AUQr1mH.html
ı really like your way of handling these subjects all the best
Thanks for watching and I'm glad you're finding the lessons helpful! :) Wishing you all the best as well!
I have a labeled Bipartite graph G = ( V, E ), V = (X,Y), i need to perform clustering on X based on the E(labels). Which algorithm can be used. Could you suggest some resources.
Well explanation! Thank you!!
Thanks for watching, Kai! So glad it helped, and if you're looking for more graph theory - check out my graph theory playlist: th-cam.com/play/PLztBpqftvzxXBhbYxoaZJmnZF6AUQr1mH.html
Does the number of vertexes have to be even in order for it to be bipartite
what if there is an edge between nodes in same set along with edges to other set, is it bipartite?
Nice outro music, too. (Made me sub to your other m-word channel.)
Haha, thank you! Let me know if you have any questions and check out my graph theory playlist for more! th-cam.com/play/PLztBpqftvzxXBhbYxoaZJmnZF6AUQr1mH.html
Very good,thanks very much
You’re very welcome, thanks for watching! Let me know if you have any video requests!
Clearly understood tq sir👍👍
You're welcome, glad it helped!
so mathematical object "function" is a particular case of bipartite graph ?
how a hard can be an easy ! thank you very much
Thanks a lot for watching! I am glad it helped :)
Hello. In the case that we're presented with an unlabeled graph as in the last example, how would you determine how to label the graph to check if it is bipartite? Thank you!
label it yourself and partition it
Thank you sir
No problem, thanks for watching!
Well done
lmaoooo what a wild evening that would be 4:42
can i ask? how to choose who is A1 A2 A3 B1 B2 B3?
No we dont ask questions at wrath of math.
Beautiful saturday evening
It was indeed!
Sir for a given vertices how many biparatite graph can be draw is any formula to find out
Thanks for the question, and it depends! Do you mean labeled bipartite graphs? If so, the problem has a fairly straightforward solution, which I may do a lesson on soon. If you asking about unlabeled bipartite graphs (so we would be counting the bipartite graphs that are distinct up to isomorphism), the problem is a good deal more tricky, and I am not sure if there is such a nice formula for it.
Hey, could u make a video abt cpa
Thanks bro!
Thank you i am scared of math's wrath 👍🙏💯🔥
Thanks for watching! No need to be scared, - with your mind, pencil, paper, and the entire internet and textbooks at your feet! You will know all you need! Check out my playlist if you're looking for more graph theory! Good luck!
th-cam.com/play/PLztBpqftvzxXBhbYxoaZJmnZF6AUQr1mH.html
can bipartite graph only be partitioned into 2 groups?
thanks!
Yes. Else we will have to call it tri-partite and so on :x
Thank you very much
My pleasure, thanks for watching! If you're looking for more graph theory, check out my graph theory playlist: th-cam.com/play/PLztBpqftvzxXBhbYxoaZJmnZF6AUQr1mH.html
Many more lessons coming and let me know if you have any video requests!
What are some of classic graphes besides Bipartite Graph?
Thanks for watching and for the question, Sophie! Are you wondering about particular graphs of interest - like the Petersen Graph, or are you wondering about classic families of graphs - like Bipartite graphs, cycles, trees, and so on?
@@WrathofMath Thank you for your reply! I'm a CS student and bipartite is a graph that we discuss a lot in the discrete math and have a lot of interesting applications in the real world. I'm wondering if there are other classic graphs that are similar to bipartite in the sense that they have very interesting properties having real-world applications. Thank you!
Is every null graph having n>=0 vertices a bipartite graph?
Thanks for watching and for the question! Assuming that by null you mean "no edges", then you can easily answer that question for yourself with this theorem: th-cam.com/video/_TIqhvDR8DQ/w-d-xo.html
Thanks dude.
Glad to help! Let me know if you have any questions, and check out my playlist if you're looking for more! th-cam.com/play/PLztBpqftvzxXBhbYxoaZJmnZF6AUQr1mH.html
Hey I know that one way to determine if a graph is bipartite is by making sure its chromatic number is 2; but I also want to know how to do it by hand. In that case, how do I know how to EXACTLY partition the vertex sets?
Also, I have a question;
th-cam.com/video/TVHL7elNm9s/w-d-xo.html --> When I coloured the second graph in this video, it didn't have a chromatic number of 2. Could someone please explain?
thank you
What's the song at the end and who is it by?
Thank you for watching! The song is called "Turn Over" and it is by me. There is no full version anywhere, but there is a link to my inactive music channel in the description if that interests you!
isn't easy to say that graph is bipartite if it can be colored with 2 colors?
Yes, absolutely! For people familiar with graph coloring, that is a very nice way to describe bipartite graphs, thanks for adding that!
A bipartite graph has two independent sets!
THANK YOU SIR
You're welcome! Thank you for watching!
Could you relink the donation link, please? Thanks for the great content. Would love to help with future videos by supporting your channel.
Thank for watching, Kevin, and I really appreciate the consideration! Here is the link to PayPal for a one time donation: www.paypal.com/donate/?token=g1RCzmhS9oEgv5e72TMhb85ixTba-jQznf2elAcIdevLFsoM6SFpvaFRoOV9C3TQatAA0G&country.x=US&locale.x=US
And here is a link to Patreon for monthly donations: www.patreon.com/join/wrathofmathlessons#no_universal_links
Any and all donations are very appreciated, and I’ll continue to provide the best lessons I can!
Awesome !
Thank you!
thanks!
No problem! Thanks for watching!
love it
👍🏻👍🏻
thanks
My pleasure, thanks for watching!
Nice
Thanks for watching!
Data analysis
...got lost in the first minute...
got it in the last minute
Glad things turned around! Thanks for watching and if you're looking for more graph theory, check out my playlist! th-cam.com/play/PLztBpqftvzxXBhbYxoaZJmnZF6AUQr1mH.html
@@WrathofMath thank you!
Dude you lost me in the first 30 seconds
👍
Thanks for watching!
4:41 Fun and wild for nerds, I guess. Just joking!
Fun and wild for nerds is fun and wild for me haha!
Ross
Thanks for watching!
Thanks sir
You're welcome, thanks for watching!
Nice
Thank you! Check out my graph theory playlist if you're looking for more: th-cam.com/play/PLztBpqftvzxXBhbYxoaZJmnZF6AUQr1mH.html
@@WrathofMath ok sir