{
  "id": "1402.5331",
  "version": "v1",
  "published": "2014-02-21T15:51:06.000Z",
  "updated": "2014-02-21T15:51:06.000Z",
  "title": "Fractional coloring of triangle-free planar graphs",
  "authors": [
    "Zdeněk Dvořák",
    "Jean-Sébastien Sereni",
    "Jan Volec"
  ],
  "categories": [
    "math.CO"
  ],
  "abstract": "We prove that every planar triangle-free graph on $n$ vertices has fractional chromatic number at most $3-\\frac{1}{n+1/3}$.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2014-02-21T15:51:06.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "05C15",
      "05C10",
      "05C72"
    ],
    "keywords": [
      "triangle-free planar graphs",
      "fractional coloring",
      "fractional chromatic number",
      "planar triangle-free graph"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2014arXiv1402.5331D"
    }
  }
}