{
  "id": "1907.12614",
  "version": "v1",
  "published": "2019-07-29T19:39:53.000Z",
  "updated": "2019-07-29T19:39:53.000Z",
  "title": "Seymour's second-neighborhood conjecture from a different perspective",
  "authors": [
    "Farid Bouya",
    "Bogdan Oporowski"
  ],
  "comment": "8 pages",
  "categories": [
    "math.CO"
  ],
  "abstract": "Seymour's Second-Neighborhood Conjecture states that every directed graph whose underlying graph is simple has at least one vertex $v$ such that the number of vertices of out-distance $2$ from $v$ is at least as large as the number of vertices of out-distance $1$ from it. We present alternative statements of the conjecture in the language of linear algebra.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2019-07-29T19:39:53.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "05C20"
    ],
    "keywords": [
      "seymours second-neighborhood conjecture states",
      "linear algebra",
      "out-distance",
      "perspective",
      "directed graph"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 8,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}