Statements (15)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:alsoKnownAs |
gptkb:reconstruction_conjecture
|
| gptkbp:appliesTo |
finite simple graphs
|
| gptkbp:field |
graph theory
|
| https://www.w3.org/2000/01/rdf-schema#label |
Kelly–Ulam conjecture
|
| gptkbp:minimumVertices |
3
|
| gptkbp:proposedBy |
gptkb:Stanislaw_Ulam
gptkb:Paul_Kelly |
| gptkbp:relatedTo |
graph isomorphism
graph reconstruction |
| gptkbp:sentence |
Every finite simple graph with at least three vertices is determined up to isomorphism by its collection of vertex-deleted subgraphs.
|
| gptkbp:status |
open problem
|
| gptkbp:yearProposed |
1941
|
| gptkbp:bfsParent |
gptkb:reconstruction_conjecture
|
| gptkbp:bfsLayer |
7
|