Twins of rayless graphs

Two non-isomorphic graphs are twins if each is isomorphic to a subgraph of the other. We prove that a rayless graph has either infinitely many twins or none.

• Type: Journal
• Year: 2011
• Where: JCT
• Authors: Anthony Bonato, Henning Bruhn, Reinhard Diestel, Philipp Sprüssel
• Keywords: JCT 2011, Non-isomorphic Graphs, Rayless Graph, Twins