×
Thomassen, Carsten

Counterexamples to the Edge Reconstruction Conjecture for infinite graphs. (English) Zbl 0405.05048

Discrete Math. 19(1977), 293-295 (1978).
Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page
scan of Zbl 0405.05048

Cited in 6 Documents

MSC:

05C60 Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.)

Keywords:

Counterexamples; Edge Reconstruction; Infinite Graphs; Vertex Reconstruction Conjecture
Cite Review PDF
Full Text: DOI

References:

[1] Fisher, J., A counterexample to the countable version of a conjecture of Ulam, J. Combinatorial Theory, 7, 364-365 (1969) · Zbl 0187.21304
[2] Fisher, J.; Graham, R. L.; Harary, F., A simpler counterexample to the Reconstruction Conjecture for denumerable graphs, J. Combinatorial Theory, 12(B), 203-204 (1972) · Zbl 0229.05140
[3] Harary, F., Graph Theory (1969), Addison-Wesley: Addison-Wesley Reading, MA · Zbl 0797.05064
[4] Harary, F., A survey of the Reconstruction Conjecture, (Bari, R.; Harary, F., Graphs and Combinatorics (1974), Springer: Springer Berlin) · Zbl 0293.05152
[5] Harary, F.; Schwenk, A. J.; Scott, R. I., On the reconstruction of countable forests, Publ. Math. Inst., 13, 39-42 (1972), (Beograd) · Zbl 0242.05101
[6] Lovász, L., A note on the line reconstruction problem, J. Combinatorial Theory Ser. B, 13, 309-310 (1972) · Zbl 0244.05112
[7] Muller, V., The Edge Reconstruction Hypothesis is true for graphs with more than \(n\) log \(n\) edges, J. Combinatorial Theory Ser. B, 22, 281-283 (1977) · Zbl 0344.05161
[8] Stockmeyer, P. K., The falsity of the Reconstruction Conjecture for tournaments, J. Graph. Theory, 1, 19-25 (1977) · Zbl 0355.05026
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.