HIGHLY ARC-TRANSITIVE DIGRAPHS - STRUCTURE AND COUNTEREXAMPLES

被引:3
作者
Devos, Matt [1 ]
Mohar, Bojan [1 ]
Samal, Robert [2 ]
机构
[1] Simon Fraser Univ, Dept Math, Burnaby, BC V5A 1S6, Canada
[2] Charles Univ Prague, Inst Comp Sci, Prague, Czech Republic
基金
加拿大自然科学与工程研究理事会;
关键词
GRAPHS;
D O I
10.1007/s00493-014-3040-4
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
Two problems of Cameron, Praeger, and Wormald [Infinite highly arc transitive digraphs and universal covering digraphs, Combinatorica (1993)] are resolved. First, locally finite highly arc-transitive digraphs with universal reachability relation are presented. Second, constructions of two-ended highly arc-transitive digraphs are provided, where each 'building block' is a finite bipartite digraph that is not a disjoint union of complete bipartite digraphs. Both of these were conjectured impossible in the above-mentioned paper. We also describe the structure of two-ended highly arc-transitive digraphs in more generality, heading towards a characterization of such digraphs. However, the complete characterization remains elusive.
引用
收藏
页码:553 / 571
页数:19
相关论文
共 14 条