Conway's 99-graph problem
E266110
UNEXPLORED
Conway's 99-graph problem is an unsolved combinatorial question in graph theory, posed by John H. Conway, concerning the existence and properties of a hypothetical 99-vertex graph with highly constrained adjacency conditions.
Jump to:
Referenced by
Referenced by (1)
Full triples — surface form annotated when it differs from this entity's canonical label.
subject surface form:
John H. Conway