Formal Statements
Given a graph, a vertex-deleted subgraph of is a subgraph formed by deleting exactly one vertex from . Clearly, it is an induced subgraph of .
For a graph, the deck of G, denoted, is the multiset of all vertex-deleted subgraphs of . Each graph in is called a card. Two graphs that have the same deck are said to be hypomorphic.
With these definitions, the conjecture can be stated as:
Reconstruction Conjecture: Any two hypomorphic graphs on at least three vertices are isomorphic.
(The requirement that the graphs have at least three vertices is necessary because both graphs on two vertices have the same decks.)
Harary suggested a stronger version of the conjecture:
Set Reconstruction Conjecture: Any two graphs on at least four vertices with the same sets of vertex-deleted subgraphs are isomorphic.
Given a graph, an edge-deleted subgraph of is a subgraph formed by deleting exactly one edge from .
For a graph, the edge-deck of G, denoted, is the multiset of all edge-deleted subgraphs of . Each graph in is called an edge-card.
Edge Reconstruction Conjecture: (Harary, 1964) Any two graphs with at least four edges and having the same edge-decks are isomorphic.
Read more about this topic: Reconstruction Conjecture
Famous quotes containing the words formal and/or statements:
“The bed is now as public as the dinner table and governed by the same rules of formal confrontation.”
—Angela Carter (1940–1992)
“He admired the terrible recreative power of his memory. It was only with the weakening of this generator whose fecundity diminishes with age that he could hope for his torture to be appeased. But it appeared that the power to make him suffer of one of Odette’s statements seemed exhausted, then one of these statements on which Swann’s spirit had until then not dwelled, an almost new word relayed the others and struck him with new vigor.”
—Marcel Proust (1871–1922)