A community for students.

Here's the question you clicked on:

55 members online
  • 0 replying
  • 0 viewing

Bee_see

  • one year ago

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...

  • This Question is Closed
  1. Bee_see
    • one year ago
    Best Response
    You've already chosen the best response.
    Medals 0

    |dw:1442270769435:dw|right?

  2. Bee_see
    • one year ago
    Best Response
    You've already chosen the best response.
    Medals 0

    I was thinking maybe this simple graph will work: |dw:1442270886218:dw|

  3. Bee_see
    • one year ago
    Best Response
    You've already chosen the best response.
    Medals 0

    Could this be an answer for the problem?

  4. Bee_see
    • one year ago
    Best Response
    You've already chosen the best response.
    Medals 0

    |dw:1442271128186:dw|

  5. Not the answer you are looking for?
    Search for more explanations.

    • Attachments:

Ask your own question

Sign Up
Find more explanations on OpenStudy
Privacy Policy

Your question is ready. Sign up for free to start getting answers.

spraguer (Moderator)
5 → View Detailed Profile

is replying to Can someone tell me what button the professor is hitting...

23

  • Teamwork 19 Teammate
  • Problem Solving 19 Hero
  • You have blocked this person.
  • ✔ You're a fan Checking fan status...

Thanks for being so helpful in mathematics. If you are getting quality help, make sure you spread the word about OpenStudy.

This is the testimonial you wrote.
You haven't written a testimonial for Owlfred.