Statements (13)
Predicate | Object |
---|---|
gptkbp:instanceOf |
gptkb:mathematical_concept
|
gptkbp:alsoKnownAs |
gptkb:Ulam's_conjecture
|
gptkbp:appliesTo |
finite simple graphs
|
gptkbp:field |
gptkb:mathematics
|
https://www.w3.org/2000/01/rdf-schema#label |
Ulam conjecture
|
gptkbp:namedAfter |
gptkb:Stanislaw_Ulam
|
gptkbp:proposedBy |
1960
|
gptkbp:relatedTo |
gptkb:reconstruction_conjecture
|
gptkbp:sentence |
Every finite simple graph is determined uniquely by its collection of vertex-deleted subgraphs (the deck of the graph).
|
gptkbp:status |
open problem
|
gptkbp:topic |
graph theory
|
gptkbp:bfsParent |
gptkb:Stan_Ulam
|
gptkbp:bfsLayer |
5
|