On the number of symbols that forces a transversal-Reference-Cited by-同舟云学术

On the number of symbols that forces a transversal

Published:2019-10-21 Issue:2 Volume:29 Page:234-240
ISSN:0963-5483
Container-title:Combinatorics, Probability and Computing
language:en
Short-container-title:Combinator. Probab. Comp.

Author:

Keevash Peter,Yepremyan Liana

Abstract

AbstractAkbari and Alipour [1] conjectured that any Latin array of order n with at least n2/2 symbols contains a transversal. For large n, we confirm this conjecture, and moreover, we show that n399/200 symbols suffice.

Publisher

Cambridge University Press (CUP)

Subject

Applied Mathematics,Computational Theory and Mathematics,Statistics and Probability,Theoretical Computer Science

Reference12 articles.

1. [9] Montgomery, R. , Pokrovskiy, A. and Sudakov, B. (2018) Decompositions into spanning rainbow structures. arXiv:1805.07564

2. [6] Gyárfás, A. and Sárközy, G. (2012) Rainbow matchings and partial transversals of Latin squares. arXiv:1208.5670

3. Modern Graph Theory

4. Combinatorial Matrix Theory

5. [2] Barát, J. and Nagy, Z. L. (2017) Transversals in generalized Latin squares. arXiv:1701.08220

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. New bounds for Ryser’s conjecture and related problems;Transactions of the American Mathematical Society, Series B;2022-04-15

2. Full rainbow matchings in graphs and hypergraphs;Combinatorics, Probability and Computing;2021-01-20

3. Decompositions into isomorphic rainbow spanning trees;Journal of Combinatorial Theory, Series B;2021-01

4. Decompositions into spanning rainbow structures;Proceedings of the London Mathematical Society;2019-04-09