HMMT November 2015 T9
- Team
- Answer
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?
Dataset text NuminaMath olympiads. Quoted with source.
Show the answer
\frac{2^{10}-10}{2^{15}}
Solutions
No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.
Similar problems
These problems have the most words in common with this statement.