{
  "id": "1307.6944",
  "version": "v1",
  "published": "2013-07-26T07:38:41.000Z",
  "updated": "2013-07-26T07:38:41.000Z",
  "title": "Coloring 2-intersecting hypergraphs",
  "authors": [
    "Lucas Colucci",
    "András Gyárfás"
  ],
  "categories": [
    "math.CO"
  ],
  "abstract": "A hypergraph is 2-intersecting if any two edges intersect in at least two vertices. Blais, Weinstein and Yoshida asked (as a first step to a more general problem) whether every 2-intersecting hypergraph has a vertex coloring with a constant number of colors so that each hyperedge e has at least min{|e|,3} colors. We show that there is such a coloring with at most 5 colors (which is best possible).",
  "revisions": [
    {
      "version": "v1",
      "updated": "2013-07-26T07:38:41.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "05C15",
      "05C65"
    ],
    "keywords": [
      "hypergraph",
      "edges intersect",
      "first step",
      "general problem",
      "constant number"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2013arXiv1307.6944C"
    }
  }
}