In graph theory, Conway's graph problem is an unsolved problem asking whether there exists an undirected graph with 99 vertices, in which each two. Download Citation on ResearchGate | Conway's Graph Problem | A solution to Conway's 99 problem, as presented on Conway's open problems list. Conway's graph problem is the second problem amongst the five $ open problems set . Four out of the five remain unsolved to. There are several ways to represent graphs in OCaml. functions, all representations are equivalent; i.e. for the following problems you.
The Conway 99 graph problem is stated here as one of 5 problems. My question is this: Is there somewhere a 99 problems graph of examples with "Conway graphs" with fewer then 99 vertices? Or can you provide examples with fewer than 99 vertices? Definition of "Conway graph": The definition is from here: Given the answer below, the next non trivial graph with 9 vertices is: I don't know why people downvoted this question; it's perfectly valid and quite interesting to wonder why such a problem is listed by Conway and how difficult it might be.
This blogpost by Adam Goucher discusses briefly at the start some of what led to the problem, before leading onto his discovery of this lovely beast.