{
  "id": "1605.03374",
  "version": "v1",
  "published": "2016-05-11T11:05:30.000Z",
  "updated": "2016-05-11T11:05:30.000Z",
  "title": "A note on Erdös-Faber-Lovász Conjecture and edge coloring of complete graphs",
  "authors": [
    "Gabriela Araujo-Pardo",
    "Adrián Vázquez-Ávila"
  ],
  "comment": "13 pages, 10 figures",
  "categories": [
    "math.CO"
  ],
  "abstract": "A linear hypergraph is intersecting if any two different edges have exactly one common vertex and an $n$-quasicluster is an intersecting linear hypergraph with $n$ edges each one containing at most $n$ vertices and every vertex is contained in at least two edges. The Erd\\\"os-Faber-Lov\\'asz Conjecture states that the chromatic number of any $n$-quasicluster is at most $n$. In the present note we prove the correctness of the conjecture for a new infinite class of $n$-quasiclusters using a specific edge coloring of the complete graph.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2016-05-11T11:05:30.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "05C15"
    ],
    "keywords": [
      "complete graph",
      "erdös-faber-lovász conjecture",
      "edge coloring",
      "quasicluster",
      "conjecture states"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 13,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}