{
  "id": "1605.05931",
  "version": "v1",
  "published": "2016-05-19T13:09:52.000Z",
  "updated": "2016-05-19T13:09:52.000Z",
  "title": "Completing Partial Latin Squares - Alternative Proof",
  "authors": [
    "Eli Shamir"
  ],
  "categories": [
    "math.CO"
  ],
  "abstract": "The problem of completing a partially specified n by n Latin square is solved by an alternative proof, based on filling the rows (or diagonals) from 1 to n, using an extended form of Hall's marriage theorem.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2016-05-19T13:09:52.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "completing partial latin squares",
      "alternative proof",
      "halls marriage theorem",
      "extended form"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}