Few families of tournaments satisfying the $n$-e.c. adjacency property are known. We supply a new random construction for generating infinite families of vertex-transitive $n$-e.c. tournaments by considering circulant tournaments. Switching is used to generate exponentially many $n$-e.c. tournaments of certain orders. With aid of a computer search, we demonstrate that there is a unique minimum order $3$-e.c. tournament of order $19,$ and there are no $3$-e.c. tournaments of orders $20,$ $21,$ and $22.$
展开▼
机译：很少有锦标赛的锦标赛，满足$ n $ -e.c. 邻接财产是已知的。我们提供了一种新的随机施工，用于通过考虑循环锦标赛来生成无限族的顶点族的顶点。锦标赛。切换用于生成指数最多的$ N $ -e.c. 锦标赛的某些订单。借助电脑搜索，我们证明有一个独特的最低订单$ 3 $ 3 $ -e.c。锦标赛$ 19，$，$ 3. 锦标赛订单20美元，$ 21，$和22美元。$
展开▼
