当前位置: X-MOL 学术Graphs Comb. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
On Explicit Random-Like Tournaments
Graphs and Combinatorics ( IF 0.7 ) Pub Date : 2021-05-07 , DOI: 10.1007/s00373-021-02330-9
Shohei Satake

We give a new theorem describing a relation between the quasi-random property of regular tournaments and their spectra. This provides many solutions to a constructing problem mentioned by Erdős and Moon (Can Math Bull 8(3):269–271, 1965) and Spencer (Graphs Comb 1(4):357–382, 1985).



中文翻译:

显式随机锦标赛

我们给出了一个新的定理,描述了常规锦标赛的准随机属性与其频谱之间的关系。这为Erdős和Moon(Can Math Bull 8(3):269-271,1965)和Spencer(Graphs Comb 1(4):357-382,1985)提到的构造问题提供了许多解决方案。

更新日期:2021-05-07
down
wechat
bug