{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,6]],"date-time":"2026-04-06T08:57:28Z","timestamp":1775465848519,"version":"3.50.1"},"reference-count":12,"publisher":"Cambridge University Press (CUP)","issue":"2","license":[{"start":{"date-parts":[[2019,10,21]],"date-time":"2019-10-21T00:00:00Z","timestamp":1571616000000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Combinator. Probab. Comp."],"published-print":{"date-parts":[[2020,3]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Akbari and Alipour [1] conjectured that any Latin array of order <jats:italic>n<\/jats:italic> with at least <jats:italic>n<\/jats:italic><jats:sup>2<\/jats:sup>\/2 symbols contains a transversal. For large <jats:italic>n<\/jats:italic>, we confirm this conjecture, and moreover, we show that <jats:italic>n<\/jats:italic><jats:sup>399\/200<\/jats:sup> symbols suffice.<\/jats:p>","DOI":"10.1017\/s0963548319000282","type":"journal-article","created":{"date-parts":[[2019,10,21]],"date-time":"2019-10-21T10:33:00Z","timestamp":1571653980000},"page":"234-240","source":"Crossref","is-referenced-by-count":5,"title":["On the number of symbols that forces a transversal"],"prefix":"10.1017","volume":"29","author":[{"given":"Peter","family":"Keevash","sequence":"first","affiliation":[]},{"given":"Liana","family":"Yepremyan","sequence":"additional","affiliation":[]}],"member":"56","published-online":{"date-parts":[[2019,10,21]]},"reference":[{"key":"S0963548319000282_ref9","unstructured":"[9] Montgomery, R. , Pokrovskiy, A. and Sudakov, B. (2018) Decompositions into spanning rainbow structures. arXiv:1805.07564"},{"key":"S0963548319000282_ref6","unstructured":"[6] Gy\u00e1rf\u00e1s, A. and S\u00e1rk\u00f6zy, G. (2012) Rainbow matchings and partial transversals of Latin squares. arXiv:1208.5670"},{"key":"S0963548319000282_ref4","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0619-4"},{"key":"S0963548319000282_ref5","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781107325708"},{"key":"S0963548319000282_ref2","unstructured":"[2] Bar\u00e1t, J. and Nagy, Z. L. (2017) Transversals in generalized Latin squares. arXiv:1701.08220"},{"key":"S0963548319000282_ref11","unstructured":"[11] Ryser, H. (1967) Neuere Probleme in der Kombinatorik. In Vortr\u00e4ge \u00fcber Kombinatorik, Mathematischen Forschungsinstitut, Oberwolfach, pp. 69\u201391."},{"key":"S0963548319000282_ref8","unstructured":"[8] Kim, J. , K\u00fchn, D. , Kupavskii, A. and Osthus, D. (2018) Rainbow structures in locally bounded colourings of graphs. arXiv:1805.08424"},{"key":"S0963548319000282_ref12","doi-asserted-by":"publisher","DOI":"10.2140\/pjm.1975.59.567"},{"key":"S0963548319000282_ref1","doi-asserted-by":"publisher","DOI":"10.1002\/jcd.20014"},{"key":"S0963548319000282_ref3","unstructured":"[3] Best, D. , Hendrey, K. , Wanless, I. M. , Wilson, T. E. and Wood, D. (2016) Transversals in Latin arrays with many distinct symbols. arXiv:1612.09443"},{"key":"S0963548319000282_ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcta.2008.01.002"},{"key":"S0963548319000282_ref10","doi-asserted-by":"publisher","DOI":"10.37236\/1618"}],"container-title":["Combinatorics, Probability and Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0963548319000282","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,3,25]],"date-time":"2020-03-25T08:15:14Z","timestamp":1585124114000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0963548319000282\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,10,21]]},"references-count":12,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2020,3]]}},"alternative-id":["S0963548319000282"],"URL":"https:\/\/doi.org\/10.1017\/s0963548319000282","relation":{},"ISSN":["0963-5483","1469-2163"],"issn-type":[{"value":"0963-5483","type":"print"},{"value":"1469-2163","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,10,21]]}}}