Statements (12)
| 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 |
Ulam's conjecture
|
| gptkbp:namedAfter |
gptkb:Stanislaw_Ulam
|
| gptkbp:relatedTo |
gptkb:graph_isomorphism_problem
|
| gptkbp:sentence |
Every finite simple graph is determined uniquely (up to isomorphism) by the multiset of its vertex-deleted subgraphs.
|
| gptkbp:status |
open
|
| gptkbp:yearProposed |
1960
|
| gptkbp:bfsParent |
gptkb:Ulam_conjecture
|
| gptkbp:bfsLayer |
6
|