A community for students.

Here's the question you clicked on:

55 members online
  • 0 replying
  • 0 viewing

dan815

  • one year ago

Anyone know any interesting open graph theory problems, unsolved problems that we could possibly write a paper on

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

    I got chu

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

    i want to see this O.O

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

    |dw:1444167912740:dw|

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

    Give me y = mx + b nub

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

    lol

  6. dan815
    • one year ago
    Best Response
    You've already chosen the best response.
    Medals 1

    -.-

  7. dan815
    • one year ago
    Best Response
    You've already chosen the best response.
    Medals 1

    stupid cats

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

    Dan is mad cuz he forgot teh basics

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

    are you referring to Paul Erd˝os theories or no?

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

    how about this Is it true that every k-connected (k>1) graph which does not have a Hamiltonian cycle has a cycle that contains k independent vertices and their neighbors? This is known to be true for k = 2 and 3. For example, the graph to the right is 3-connected but not Hamiltonian. And the dotted cycle shown contains 3 independent vertices (the three vertices which are lighter in color) and thier neighbors. To see that it is not Hamiltonian, notice that this graph is just the complete bipartite graph K(3,4).

    1 Attachment
  11. anonymous
    • one year ago
    Best Response
    You've already chosen the best response.
    Medals 0

    that is a nice one :)

  12. dan815
    • one year ago
    Best Response
    You've already chosen the best response.
    Medals 1

    what does it mean independent vertices and their neighbors

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

    they exist on the same plane

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

    get it?

  15. dan815
    • one year ago
    Best Response
    You've already chosen the best response.
    Medals 1

    not really a bit confused still

  16. dan815
    • one year ago
    Best Response
    You've already chosen the best response.
    Medals 1

    what does it mean 3-connected

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

    my favorite is Euler trail but it already had a solution so :-\

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

    vertices act as vertices. 3- means it has 3 independent vertices

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

    lol its just kinnda intuitive

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

    yea.. have fun i did this a while back and i really don't feel like doing it again but i had it saved so yea

  21. dan815
    • one year ago
    Best Response
    You've already chosen the best response.
    Medals 1

    ohh i see now

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

    yea

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

    cool

  24. dan815
    • one year ago
    Best Response
    You've already chosen the best response.
    Medals 1

    interesting.. so this thm says a cycle must exist such that it contains all the set of k independant vertices?

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

    YES

  26. dan815
    • one year ago
    Best Response
    You've already chosen the best response.
    Medals 1

    depending on the vertices you pick you will get a different number for k

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

    you got it

  28. dan815
    • one year ago
    Best Response
    You've already chosen the best response.
    Medals 1

    i cant say the last statement for sure, it seems like its true though

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

    it all depends on the independent vertices

  30. dan815
    • one year ago
    Best Response
    You've already chosen the best response.
    Medals 1

    yeah

  31. dan815
    • one year ago
    Best Response
    You've already chosen the best response.
    Medals 1

    kinda seems hard lol

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

    it is

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

    but its fun

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

    are you a professor?

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

    or college student?

  36. dan815
    • one year ago
    Best Response
    You've already chosen the best response.
    Medals 1

    yeah it seems fun :D and i am

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

    Nice well im only a Senior in HS so i guess you would be able to explain to yourself more then i could at this point lol

  38. dan815
    • one year ago
    Best Response
    You've already chosen the best response.
    Medals 1

    (: im a girl

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

    @Musicdude her name is danika for any other details i know everything about this girl :D

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

    lol

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