A community for students.
Here's the question you clicked on:
 0 viewing
dan815
 one year ago
Anyone know any interesting open graph theory problems, unsolved problems that we could possibly write a paper on
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

anonymous
 one year ago
Best ResponseYou've already chosen the best response.0i want to see this O.O

ShadowLegendX
 one year ago
Best ResponseYou've already chosen the best response.0dw:1444167912740:dw

ShadowLegendX
 one year ago
Best ResponseYou've already chosen the best response.0Give me y = mx + b nub

ShadowLegendX
 one year ago
Best ResponseYou've already chosen the best response.0Dan is mad cuz he forgot teh basics

anonymous
 one year ago
Best ResponseYou've already chosen the best response.0are you referring to Paul Erd˝os theories or no?

anonymous
 one year ago
Best ResponseYou've already chosen the best response.0how about this Is it true that every kconnected (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 3connected 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).

anonymous
 one year ago
Best ResponseYou've already chosen the best response.0that is a nice one :)

dan815
 one year ago
Best ResponseYou've already chosen the best response.1what does it mean independent vertices and their neighbors

anonymous
 one year ago
Best ResponseYou've already chosen the best response.0they exist on the same plane

dan815
 one year ago
Best ResponseYou've already chosen the best response.1not really a bit confused still

dan815
 one year ago
Best ResponseYou've already chosen the best response.1what does it mean 3connected

ikram002p
 one year ago
Best ResponseYou've already chosen the best response.0my favorite is Euler trail but it already had a solution so :\

anonymous
 one year ago
Best ResponseYou've already chosen the best response.0vertices act as vertices. 3 means it has 3 independent vertices

anonymous
 one year ago
Best ResponseYou've already chosen the best response.0lol its just kinnda intuitive

anonymous
 one year ago
Best ResponseYou've already chosen the best response.0yea.. 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

dan815
 one year ago
Best ResponseYou've already chosen the best response.1interesting.. so this thm says a cycle must exist such that it contains all the set of k independant vertices?

dan815
 one year ago
Best ResponseYou've already chosen the best response.1depending on the vertices you pick you will get a different number for k

dan815
 one year ago
Best ResponseYou've already chosen the best response.1i cant say the last statement for sure, it seems like its true though

anonymous
 one year ago
Best ResponseYou've already chosen the best response.0it all depends on the independent vertices

anonymous
 one year ago
Best ResponseYou've already chosen the best response.0are you a professor?

dan815
 one year ago
Best ResponseYou've already chosen the best response.1yeah it seems fun :D and i am

anonymous
 one year ago
Best ResponseYou've already chosen the best response.0Nice 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

ikram002p
 one year ago
Best ResponseYou've already chosen the best response.0@Musicdude her name is danika for any other details i know everything about this girl :D
Ask your own question
Sign UpFind more explanations on OpenStudy
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
 Engagement 19 Mad Hatter
 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.