Other Structures
It has been shown that the following are not in general reconstructible:
- Digraphs: Infinite families of non-reconstructible digraphs are known, including tournaments (Stockmeyer) and non-tournaments (Stockmeyer). A tournament is reconstructible if it is not strongly connected. A weaker version of the reconstruction conjecture has been conjectured for digraphs, see New digraph reconstruction conjecture.
- Hypergraphs (Kocay).
- Infinite graphs. Let T be a tree on an infinite number of vertices such that every vertex has infinite degree. The counterexample is T and 2T. The question of reconstructibility for locally finite infinite graphs is still open.
Read more about this topic: Reconstruction Conjecture
Famous quotes containing the word structures:
“The American who has been confined, in his own country, to the sight of buildings designed after foreign models, is surprised on entering York Minster or St. Peter’s at Rome, by the feeling that these structures are imitations also,—faint copies of an invisible archetype.”
—Ralph Waldo Emerson (1803–1882)
“It is clear that all verbal structures with meaning are verbal imitations of that elusive psychological and physiological process known as thought, a process stumbling through emotional entanglements, sudden irrational convictions, involuntary gleams of insight, rationalized prejudices, and blocks of panic and inertia, finally to reach a completely incommunicable intuition.”
—Northrop Frye (b. 1912)