Statements (13)
Predicate | Object |
---|---|
gptkbp:instanceOf |
gptkb:mathematical_concept
|
gptkbp:appliesTo |
finite simple graphs with at least three vertices
|
gptkbp:field |
graph theory
|
https://www.w3.org/2000/01/rdf-schema#label |
reconstruction conjecture
|
gptkbp:proposedBy |
gptkb:Stanislaw_Ulam
gptkb:Paul_J._Kelly |
gptkbp:relatedTo |
gptkb:Kelly–Ulam_conjecture
graph isomorphism |
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
|
gptkbp:yearProposed |
1941
|
gptkbp:bfsParent |
gptkb:Ulam_conjecture
|
gptkbp:bfsLayer |
6
|