{
  "id": "1512.02404",
  "version": "v1",
  "published": "2015-12-08T11:08:04.000Z",
  "updated": "2015-12-08T11:08:04.000Z",
  "title": "A sufficient condition for a pair of sequences to be bipartite graphic",
  "authors": [
    "Grant Cairns",
    "Stacey Mendan",
    "Yuri Nikolayevsky"
  ],
  "comment": "5 pages",
  "categories": [
    "math.CO"
  ],
  "abstract": "We present a sufficient condition for a pair of finite integer sequences to be degree sequences of a bipartite graph, based only on the lengths of the sequences and their largest and smallest elements.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2015-12-08T11:08:04.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "05C07"
    ],
    "keywords": [
      "sufficient condition",
      "bipartite graphic",
      "finite integer sequences",
      "smallest elements",
      "degree sequences"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 5,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2015arXiv151202404C"
    }
  }
}