Statements (15)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:alsoKnownAs |
the 99-graph problem
|
| gptkbp:describes |
Asks whether there exists a simple, undirected graph with 99 vertices, each pair of vertices having exactly one common neighbor.
|
| gptkbp:field |
graph theory
|
| gptkbp:hasVertexCount |
99
|
| https://www.w3.org/2000/01/rdf-schema#label |
Conway's 99-graph problem
|
| gptkbp:namedAfter |
gptkb:John_Horton_Conway
|
| gptkbp:proposedBy |
1969
|
| gptkbp:relatedTo |
strongly regular graph
triangle-free graphs |
| gptkbp:status |
unsolved
|
| gptkbp:bfsParent |
gptkb:John_H._Conway
gptkb:John_Horton_Conway gptkb:John_Conway |
| gptkbp:bfsLayer |
5
|