A proof of the rooted tree alternative conjecture

被引：13
|
作者：
Tyomkyn, Mykhaylo [1 ]
机构：
[1] Univ Cambridge, Dept Pure Math & Math Stat, Ctr Math Sci, Cambridge CB3 0WB, England
来源：
DISCRETE MATHEMATICS | 2009年 / 309卷 / 20期
关键词：
Infinite graphs; Trees; Graph isomomorphisms; GRAPHS;
D O I：
10.1016/j.disc.2009.04.025
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
Bonato and Tardif [A. Bonato, C. Tardif, Mutually embeddable graphs and the tree alternative conjecture, J. Combinatorial Theory, Series B 96 (2006), 874-880] conjectured that the number of isomorphism classes of trees mutually embeddable with a given tree T is either 1 or infinite. We prove the analogue of their conjecture for rooted trees. We also make some progress towards the original conjecture for locally finite trees and state some new conjectures. (C) 2009 Elsevier B.V. All rights reserved.
引用
收藏
页码：5963 / 5967
页数：5
相关论文
共 38 条
1234