A counterexample to the countable version of a conjecture of Ulam
From MaRDI portal
Publication:5578817
DOI10.1016/S0021-9800(69)80063-3zbMath0187.21304WikidataQ123314236 ScholiaQ123314236MaRDI QIDQ5578817
Publication date: 1969
Published in: Journal of Combinatorial Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0021-9800(69)80063-3
05C60: Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.)
Related Items
The double reconstruction conjecture about finite colored hypergraphs, Simpler counterexamples to the edge-reconstruction conjecture for infinite graphs, Counterexamples to the Edge Reconstruction Conjecture for infinite graphs, A simpler counterexample to the reconstruction conjecture for denumerable graphs, Unnamed Item