{
  "id": "1102.4856",
  "version": "v1",
  "published": "2011-02-23T21:07:14.000Z",
  "updated": "2011-02-23T21:07:14.000Z",
  "title": "New lower bounds for the independence number of sparse graphs and hypergraphs",
  "authors": [
    "Kunal Dutta",
    "Dhruv Mubayi",
    "C. R. Subramanian"
  ],
  "categories": [
    "math.CO"
  ],
  "abstract": "We obtain new lower bounds for the independence number of $K_r$-free graphs and linear $k$-uniform hypergraphs in terms of the degree sequence. This answers some old questions raised by Caro and Tuza \\cite{CT91}. Our proof technique is an extension of a method of Caro and Wei \\cite{CA79, WE79}, and we also give a new short proof of the main result of \\cite{CT91} using this approach. As byproducts, we also obtain some non-trivial identities involving binomial coefficients.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2011-02-23T21:07:14.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "05D40"
    ],
    "keywords": [
      "independence number",
      "lower bounds",
      "sparse graphs",
      "binomial coefficients",
      "degree sequence"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2011arXiv1102.4856D"
    }
  }
}