Problem:
A graph consists of 6 vertices. For each pair of vertices, a coin is flipped, and an edge connecting the two vertices is drawn if and only if the coin shows heads. Such a graph is good if, starting from any vertex connected to at least one other vertex, it is possible to draw a path starting and ending at that traverses each edge exactly once. What is the probability that the graph is good?
, 2015
Solution
Solution:
First, we find the probability that all vertices have even degree. Arbitrarily number the vertices . Flip the coin for all the edges out of vertex ; this vertex ends up with even degree with probability . Next we flip for all the remaining edges out of vertex ; regardless of previous edges, vertex ends up with even degree with probability , and so on through vertex . Finally, if vertices through all have even degree, vertex must also have even degree. So all vertices have even degree with probability .
There are edges total, so there are total possible graphs, of which have all vertices with even degree. Observe that exactly of these latter graphs are not good, namely, the graphs composed of two separate triangles. So of our graphs are good, and the probability that a graph is good is .