Math heads help vol math 71

[shaky3]

I need to prove the following statement not by induction: A graph on six (or more) vertices must contain either K3 (the complete graph on three vertices) or O3(the empty graph on three vertices). Thanks to anyone that helps

 

[seniosoul]

BANNED/WARNED

 

[ninjallamafromhell]

I don't do proofs sorry.

 

[jrp44]

Just write...."It's right because Stone Cold Said So"

 

[acidicality]

just draw that !%!! out....easy.

 

[certifiedsw]

Do your own homework