{
  "id": "1401.6711",
  "version": "v1",
  "published": "2014-01-27T01:11:16.000Z",
  "updated": "2014-01-27T01:11:16.000Z",
  "title": "Large subgraphs without complete bipartite graphs",
  "authors": [
    "David Conlon",
    "Jacob Fox",
    "Benny Sudakov"
  ],
  "comment": "4 pages",
  "categories": [
    "math.CO"
  ],
  "abstract": "In this note, we answer the following question of Foucaud, Krivelevich and Perarnau. What is the size of the largest $K_{r,s}$-free subgraph one can guarantee in every graph $G$ with $m$ edges? We also discuss the analogous problem for hypergraphs.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2014-01-27T01:11:16.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "complete bipartite graphs",
      "large subgraphs",
      "free subgraph",
      "hypergraphs",
      "analogous problem"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 4,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2014arXiv1401.6711C"
    }
  }
}