𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Almost reconstructing infinite, rayless graphs

✍ Scribed by Rüdiger Schmidt

Publisher
John Wiley and Sons
Year
1985
Tongue
English
Weight
291 KB
Volume
9
Category
Article
ISSN
0364-9024

No coin nor oath required. For personal study only.

✦ Synopsis

We show that for every infinite, rayless graph G the following holds. If G is hypomorphic to H then G is isomorphic to an induced subgraph of H and H is isomorphic to an induced subgraph of G. This proves a conjecture of R. Halin for the class of infinite, rayless graphs and partly extends a result of Bondy and Hemminger. The proof makes use of the structure theory for rayless graphs which was developed by the author in a previous paper.

📜 SIMILAR VOLUMES

On the reconstruction of rayless infinit
On the reconstruction of rayless infinite forests
✍ Thomas Andreae; Rüdiger Schmidt 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 869 KB

## Abstract A graph __G__ is called strongly __p__‐reconstructible if it is (up to isomorphism) uniquely determined by the collection of its pairwise nonisomorphic subgraphs __G__ – __v__ where __v__ is a pendent vertex of __G__. Using previous results of the second author concerning the structure

Reconstruction of infinite graphs
Reconstruction of infinite graphs
✍ C.St.J.A. Nash-Williams 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 929 KB

The paper recalls several known results concerning reconstruction and edge-reconstruction of infinite graphs, and draws attention to some possibly interesting unsolved problems.

Reconstructibility versus edge reconstru
Reconstructibility versus edge reconstructibility of infinite graphs
✍ Carsten Thomassen 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 151 KB

## RECONgTRUCTIBILITY VERSUI~ EDGE RECONSTR1UCTIBILtlY OF !NF![?CTE GN~APNS Cars,~en -FI-!Ob,~ ASSEN A.hah,,\*~atL~k /~.t;tir~\*., t h~ieersi;e~sp ~tk~'n, S0{P} Aarbus C. Detm~a& Rcc~ .d 23 [;cccm~cr 1~)77 [~¢ :{>.cd 7 April D)TS For every cm~dma! a >R o ~here exi::ts an ,:t-rQ,',ular .g;api~ w[?

Almost every graph has reconstruction nu
Almost every graph has reconstruction number three
✍ Béla Bollobás 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 153 KB

## Abstract The paper contains a proof of the conjecture of Harary and Plantholt, stated in the title.

Reconstructing the number of copies of a
Reconstructing the number of copies of a valency-labeled finite graph in an infinite graph
✍ A. J. H. King; C. St. J. A. Nash-Williams 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 489 KB 👁 1 views

## Abstract Suppose that __G, H__ are infinite graphs and there is a bijection Ψ; V(G) Ψ V(H) such that __G__ ‐ ξ ≅ H ‐ Ψ(ξ) for every ξ ∼ __V__(G). Let __J__ be a finite graph and /(π) be a cardinal number for each π ≅ __V__(J). Suppose also that either /(π) is infinite for every π ≅ __V__(J) or _