Premium
Almost reconstructing infinite, rayless graphs
Author(s) -
Schmidt Rüdiger
Publication year - 1985
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/jgt.3190090202
Subject(s) - mathematics , combinatorics , conjecture , discrete mathematics , graph , pathwidth , class (philosophy) , induced subgraph , line graph , computer science , vertex (graph theory) , artificial intelligence
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 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.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom