{
  "id": "1106.3098",
  "version": "v1",
  "published": "2011-06-15T20:43:46.000Z",
  "updated": "2011-06-15T20:43:46.000Z",
  "title": "On independent sets in hypergraphs",
  "authors": [
    "Alexander Kostochka",
    "Dhruv Mubayi",
    "Jacques Versatraete"
  ],
  "categories": [
    "math.CO"
  ],
  "abstract": "The independence number of a hypergraph H is the size of a largest set of vertices containing no edge of H. In this paper, we prove new sharp bounds on the independence number of n-vertex (r+1)-uniform hypergraphs in which every r-element set is contained in at most d edges, where 0 < d < n/(log n)^{3r^2}. Our relatively short proof extends a method due to Shearer. We give an application to hypergraph Ramsey numbers involving independent neighborhoods.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2011-06-15T20:43:46.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "independent sets",
      "independence number",
      "relatively short proof extends",
      "hypergraph ramsey numbers",
      "sharp bounds"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2011arXiv1106.3098K"
    }
  }
}