Title of article :
Twins of rayless graphs
Author/Authors :
Bonato، نويسنده , , Anthony and Bruhn، نويسنده , , Henning and Diestel، نويسنده , , Reinhard and Sprüssel، نويسنده , , Philipp، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 2011
Abstract :
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.
Keywords :
Infinite graphs , rayless graphs , Graph homomorphism , embedding
Journal title :
Journal of Combinatorial Theory Series B
Journal title :
Journal of Combinatorial Theory Series B
