Uncountable families of vertex-transitive graphs of finite degree

被引:2
作者
Leader, I
Markström, K
机构
[1] Univ Cambridge, Dept Pure Math & Math Stat, Cambridge CB3 0WB, England
[2] Umea Univ, Dept Math & Math Sci, SE-90187 Umea, Sweden
关键词
vertex transitive graphs; Cayley graphs; infinite graphs;
D O I
10.1016/j.disc.2006.01.021
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
We prove that the set of vertex-transitive graphs of finite degree is uncountably large. (c) 2006 Published by Elsevier B.V.
引用
收藏
页码:678 / 679
页数:2
相关论文
共 3 条
[1]  
HAGGSTROM O, COMMUNICATION
[2]  
Lauri J., 2003, London Mathematical Society Lecture Note Series, P20
[3]  
Neumann BH., 1937, J LOND MATH SOC, V1, P120, DOI [10.1112/jlms/s1-12.46.120, DOI 10.1112/JLMS/S1-12.46.120]