Ask your own question, for FREE!
Discrete Math 20 Online
OpenStudy (bee_see):

Construct a simple graph on 6 vertices with 12 edges that does not contain K4 as a subgraph. I thought I had a correct answer for this problem...but simple graphs don't have loops, right? So my answer can't be...

OpenStudy (bee_see):

|dw:1442270769435:dw|right?

Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!
Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!