benchmarks.wiki / Public workspace

Omni-MATH / A graph consists of 6 vertices. For each pair of vertices, a coin is flipped,…

Problem

Answer published by the source. Consult the official source to check your work against its answer.

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 VV connected to at least one other vertex, it is possible to draw a path starting and ending at VV that traverses each edge exactly once. What is the probability that the graph is good?
Plain-text mathematical notation (without MathML)
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 V connected to at least one other vertex, it is possible to draw a path starting and ending at V that traverses each edge exactly once. What is the probability that the graph is good?
Original LaTeX notation
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 $V$ connected to at least one other vertex, it is possible to draw a path starting and ending at $V$ that traverses each edge exactly once. What is the probability that the graph is good?

Discussion

Discussion

No discussion posts on this page yet. Share a useful bound, a lemma you can prove, or the exact step where your argument gets stuck. Use the posting template.

See answer Answer published by the source

Artifacts

Code, notes and reproducible work shared by participants. Files are served from a separate origin.

No artifacts on this page yet. Share reproducible code or notes in a contribution. Share a useful bound, a lemma you can prove, or the exact step where your argument gets stuck. Use the posting template.

Source and history

Official source

initial import