It has been brought to my attention by Ramachandran that there is an error in the proof of Theorem 1 in my paper [1]. The theorem is true-the pairs of vertex-deleted tournaments are isomorphic-but the description of the isomorphism is incorrect. The number r i should not be the remainder of i modulo
The falsity of the reconstruction conjecture for tournaments
β Scribed by Paul K. Stockmeyer
- Publisher
- John Wiley and Sons
- Year
- 1977
- Tongue
- English
- Weight
- 306 KB
- Volume
- 1
- Category
- Article
- ISSN
- 0364-9024
No coin nor oath required. For personal study only.
β¦ Synopsis
Abstract
The conjecture that for all sufficiently large p any tournament of order p is uniquely reconstructable from its pointβdeleted subtournaments is shown to be false. Counterexamples are presented for all orders of the form 2^n^ + 1 and 2^n^ + 2. The largest previously known counterexamples were of order 8.
π SIMILAR VOLUMES
It is shown that the Reconstruction Conjecture is true for all finite graphs if it is true for the 2-connected ones. We shall, for the most part, use the terminology of [2] and [ 4 ] . Graphs will be finite, simple, and undirected. Let G be a graph and u E V(G). Denote by d(u) the degree of u in G
The knights prepare for combat, but the killings aren't on the field... It's 1322, and plans to host a tournament in the spring give moneylenders everywhere a golden opportunity. Many knights in Devon are already indebted to Benjamin Dudenay, and when a month before the festivities, he is found bea