101
click to vote
JCT
2011
14 years 9 months ago
2011
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.
108
click to vote
COMBINATORICA
2010
14 years 9 months ago
2010
We prove that every rayless graph has an unfriendly partition.