{
  "id": "1805.10911",
  "version": "v1",
  "published": "2018-05-28T13:29:07.000Z",
  "updated": "2018-05-28T13:29:07.000Z",
  "title": "On the number of symbols that forces a transversal",
  "authors": [
    "Peter Keevash",
    "Liana Yepremyan"
  ],
  "comment": "6 pages, 1 figure",
  "categories": [
    "math.CO",
    "cs.DM"
  ],
  "abstract": "Akbari and Alipour conjectured that any Latin array of order $n$ with at least $n^2/2$ symbols contains a transversal. We confirm this conjecture for large $n$, and moreover, we show that $n^{399/200}$ symbols suffice.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2018-05-28T13:29:07.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "transversal",
      "latin array",
      "symbols contains",
      "symbols suffice"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 6,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}