Related papers: Ulam's Conjecture is True for Connected Graphs

This paper has been withdrawn by UCHINO.

The paper has been withdrawn by the author due to a crucial error.

This paper has been withdrawn to address an omission. It will be resubmitted in the near future.

This paper has been withdrawn by the author due to a crucial error in last part of proof.

This paper has been withdrawn by the author due to some problems.

The paper has been withdrawn by the authors

This paper was withdrawn by the authors. The mistake in math.AG/0209223 affects also this paper.

The Reconstruction Conjecture of Ulam asserts that, for $n\geq 3$, every $n$-vertex graph is determined by the multiset of its induced subgraphs with $n-1$ vertices. The conjecture is known to hold for various special classes of graphs but…

This paper has been withdrawn by author due to an error in the proof.

This paper has been withdrawn while the author verifies the literature.

This paper has been withdrawn by the author since the proof of Lemma 8 is not correct.

We construct a simple acyclic directed graph for which the Bunkbed Conjecture is false, thereby resolving conjectures posed by Leander and by Hollom.

This paper has been withdrawn by the author.

This paper has been withdrawn by the author. Much simpler proof of the main result was obtained which led to major changes in the presentation.

This paper has been withdrawn by the author. The conjecture follows from the finiteness of group von Neumann algebras.

This paper has been withdrawn by the author

The paper is withdrawn.

This paper has been withdrawn by the author due to its publication

This paper has been withdrawn by the author due to an error in the proof.

This paper has been withdrawn by the authour.