Explaining Components of Graphs | Graph Theory 

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! ru-vid.com/show-UCyEKvaxi8mt9FMc62MHcliwjoin Graph Theory course: ru-vid.com/group/PLztBpqftvzxXBhbYxoaZJmnZF6AUQr1mH Graph Theory exercises: ru-vid.com/group/PLztBpqftvzxXtYASoshtU3yEKqEmo1o1L

also this is a great video. your fans certainly appreciate you taking the time to clear up the same confusion i had about the previous video. though given that i have an introductory background with pure math, i was able to make sense of it before this video started, and yes i arrived at the same explanation that you give in this video

You definitely deserve my subscribe. This video was quite meticulous and cleared up any confusion one might have from the last go around with this concept. Keep up the great work.

I had the same confusion with your previous video, about being able to technically add more edges, and still having the graph be connected, but of course then the connected subgraph would no longer even be a subgraph of G in the first place, as we have added a new edge. When talking about maximal connectiveness I guess we just have to be careful to only consider the vertices in the original graph G. So thanks for clearing that up, this video was very well explained as usual :) know that you are saving my degree right now Sean🙏🏼👏

Clearest explanation in the internet, thank you so much !!

good job getting the borders for the on screen text. definitely better than not being able to read it some of the words

Trying to study graph theory without watching this excellent playlist would definitely be...disconnected.

I'll make it simple if a graph G has A, B and C components and also there is a D subgraph of A this D graph is nothing but a part of already existing graph A which means we can add some edges/nodes to the D subgraph and make it graph A which is a component of graph G. So G: A, B, C , D ; A{ D }. Adding edges to make it maximal => D + (some edges) = A therefore D is not a component it's just a subgraph of A. So Number of components of G is 3 not 4.

Well done. I didnt get it on the last video but it makes sense now. Much appreciated

brilliant video, thank you again and again

6:25 This is sort of like asking why {1, 2, 3, 4, 5} can't be a subset of {1, 2, 3, 4}; it includes extra stuff.

best lecture . Thank you so much.

also thanks so much for reply on your previous video

Thank you sir. Best explanation.

Ahhh. I finally understood this.

This is gold

So each graph is trivially its own component?

We can say that a subgraph of G is not maximum, if it's a subgraph of another connected subgraph of G.

Hi Sir, can I ask if how does a C_4 - free bipartite graph look like ?

THIS WAS REALLY HELPFUL.THANK YOU WRATH OF MATH.. THEY ARE THE SWANKIEST LESSONS LOL

Thanku sir

Sir please explain k-plex,k-clan and k-club

IF PERSON A KNOWS PERSON B AND PERSON B DOESN'T KNOW PERSON A. SHOULD I CONNECT THEM?

JK, IT WAS A DARE, PLEASE FORGIVE ME

IF PERSON A KNOWS PERSON B AND PERSON B DOESN'T KNOW PERSON A. SHOULD I CONNECT THEM?

IF PERSON A KNOWS PERSON B AND PERSON B DOESN'T KNOW PERSON A. SHOULD I CONNECT THEM?