dan815
  • dan815
Anyone know any interesting open graph theory problems, unsolved problems that we could possibly write a paper on
Mathematics
  • Stacey Warren - Expert brainly.com
Hey! We 've verified this expert answer for you, click below to unlock the details :)
SOLVED
At vero eos et accusamus et iusto odio dignissimos ducimus qui blanditiis praesentium voluptatum deleniti atque corrupti quos dolores et quas molestias excepturi sint occaecati cupiditate non provident, similique sunt in culpa qui officia deserunt mollitia animi, id est laborum et dolorum fuga. Et harum quidem rerum facilis est et expedita distinctio. Nam libero tempore, cum soluta nobis est eligendi optio cumque nihil impedit quo minus id quod maxime placeat facere possimus, omnis voluptas assumenda est, omnis dolor repellendus. Itaque earum rerum hic tenetur a sapiente delectus, ut aut reiciendis voluptatibus maiores alias consequatur aut perferendis doloribus asperiores repellat.
chestercat
  • chestercat
I got my questions answered at brainly.com in under 10 minutes. Go to brainly.com now for free help!
ShadowLegendX
  • ShadowLegendX
I got chu
anonymous
  • anonymous
i want to see this O.O
ShadowLegendX
  • ShadowLegendX
|dw:1444167912740:dw|

Looking for something else?

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

More answers

ShadowLegendX
  • ShadowLegendX
Give me y = mx + b nub
anonymous
  • anonymous
lol
dan815
  • dan815
-.-
dan815
  • dan815
stupid cats
ShadowLegendX
  • ShadowLegendX
Dan is mad cuz he forgot teh basics
anonymous
  • anonymous
are you referring to Paul Erd╦Łos theories or no?
anonymous
  • anonymous
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
anonymous
  • anonymous
that is a nice one :)
dan815
  • dan815
what does it mean independent vertices and their neighbors
anonymous
  • anonymous
they exist on the same plane
anonymous
  • anonymous
get it?
dan815
  • dan815
not really a bit confused still
dan815
  • dan815
what does it mean 3-connected
ikram002p
  • ikram002p
my favorite is Euler trail but it already had a solution so :-\
anonymous
  • anonymous
vertices act as vertices. 3- means it has 3 independent vertices
anonymous
  • anonymous
lol its just kinnda intuitive
anonymous
  • anonymous
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
dan815
  • dan815
ohh i see now
anonymous
  • anonymous
yea
anonymous
  • anonymous
cool
dan815
  • dan815
interesting.. so this thm says a cycle must exist such that it contains all the set of k independant vertices?
anonymous
  • anonymous
YES
dan815
  • dan815
depending on the vertices you pick you will get a different number for k
anonymous
  • anonymous
you got it
dan815
  • dan815
i cant say the last statement for sure, it seems like its true though
anonymous
  • anonymous
it all depends on the independent vertices
dan815
  • dan815
yeah
dan815
  • dan815
kinda seems hard lol
anonymous
  • anonymous
it is
anonymous
  • anonymous
but its fun
anonymous
  • anonymous
are you a professor?
anonymous
  • anonymous
or college student?
dan815
  • dan815
yeah it seems fun :D and i am
anonymous
  • anonymous
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
dan815
  • dan815
(: im a girl
ikram002p
  • ikram002p
@Musicdude her name is danika for any other details i know everything about this girl :D
anonymous
  • anonymous
lol

Looking for something else?

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