Counterexamples to the Edge Reconstruction Conjecture for infinite graphs

DOI10.1016/0012-365X(77)90111-XzbMath0405.05048WikidataQ123301473 ScholiaQ123301473MaRDI QIDQ1257028

Carsten Thomassen

Publication date: 1978

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

CounterexamplesInfinite GraphsEdge ReconstructionVertex Reconstruction Conjecture

Mathematics Subject Classification ID

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

Related Items (5)

A survey on edge reconstruction of graphs ⋮ Simpler counterexamples to the edge-reconstruction conjecture for infinite graphs ⋮ Reconstruction of infinite graphs ⋮ Reconstructibility versus edge reconstructibility of infinite graphs ⋮ On the edge reconstruction of locally finite disconnected graphs with a finite number of components

Cites Work

• The edge reconstruction hypothesis is true for graphs with more than n log n edges
• Parallel concepts in graph theory
• A simpler counterexample to the reconstruction conjecture for denumerable graphs
• A note on the line reconstruction problem
• The falsity of the reconstruction conjecture for tournaments
• A counterexample to the countable version of a conjecture of Ulam
• Unnamed Item
• Unnamed Item

This page was built for publication: Counterexamples to the Edge Reconstruction Conjecture for infinite graphs