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.
math.CO↗
arXiv subjects
H. Bruhn
Publications and source records attributed to H. Bruhn.