当前位置:
X-MOL 学术
›
Comb. Probab. Comput.
›
论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
On the number of symbols that forces a transversal
Combinatorics, Probability and Computing ( IF 0.9 ) Pub Date : 2019-10-21 , DOI: 10.1017/s0963548319000282 Peter Keevash , Liana Yepremyan
Combinatorics, Probability and Computing ( IF 0.9 ) Pub Date : 2019-10-21 , DOI: 10.1017/s0963548319000282 Peter Keevash , Liana Yepremyan
Akbari and Alipour [1] conjectured that any Latin array of order n with at least n 2 /2 symbols contains a transversal. For large n , we confirm this conjecture, and moreover, we show that n 399/200 symbols suffice.
中文翻译:
关于强制横向的符号数量
Akbari 和 Alipour [1] 推测任何拉丁顺序排列n 至少与n 2 /2 符号包含一个横向符号。对于大n , 我们证实了这个猜想, 而且, 我们证明了n 399/200 符号就足够了。
更新日期:2019-10-21
中文翻译:
关于强制横向的符号数量
Akbari 和 Alipour [1] 推测任何拉丁顺序排列