Proof: A Graph or its Complement is not Bipartite | Graph Theory, Bipartite Graphs

[@PunmasterSTP]

Ah that was a neat trick! I didn't even think about how you'd have to get a three-cycle when you complement the partite sets.

[@lachuvinoj1352]

You explain really well, I understood the concept clearly. Thank you!!!

[@WrathofMath]

Glad to hear it! Thanks so much for watching!

[@samueldurkac7452]

So is it true that if any graph G with at least five vertices is bipartite then the complement of G must not be bipartite ?

[@samueldurkac7452]

Well this is what I can deduce from the video (as not in form of some disjunction but as an implication).

[@PunmasterSTP]

Yes, I think that is correct.

[@Kaviyugamithran]

Please Say detialed about tree decompositions topic in graph theory sir.....

[@لُطف-ب9خ]

Let G be a connected self-complementary graph. Then diam(G)=2 or 3.
How to proof this theory??

[@GBSZ12]

very helpful!! thank you!!

[@WrathofMath]

Glad to hear it! You're welcome and thanks for watching, let me know if you ever have any questions!

[@tshepomogagabe1533]

Thank You So Much!!!

[@WrathofMath]

My pleasure! Thanks for watching!