{
  "id": "1011.3381",
  "version": "v1",
  "published": "2010-11-15T13:47:01.000Z",
  "updated": "2010-11-15T13:47:01.000Z",
  "title": "Equivalence between Extendibility and Factor-Criticality",
  "authors": [
    "Zan-Bo Zhang",
    "Tao Wang",
    "Dingjun Lou"
  ],
  "comment": "This paper has been published at Ars Combinatoria",
  "journal": "Ars Combinatoria, 85(2007), 279-285",
  "categories": [
    "math.CO"
  ],
  "abstract": "In this paper, we show that if $k\\geq (\\nu+2)/4$, where $\\nu$ denotes the order of a graph, a non-bipartite graph $G$ is $k$-extendable if and only if it is $2k$-factor-critical. If $k\\geq (\\nu-3)/4$, a graph $G$ is $k\\ 1/2$-extendable if and only if it is $(2k+1)$-factor-critical. We also give examples to show that the two bounds are best possible. Our results are answers to a problem posted by Favaron [3] and Yu [11].",
  "revisions": [
    {
      "version": "v1",
      "updated": "2010-11-15T13:47:01.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "05C70"
    ],
    "keywords": [
      "equivalence",
      "factor-criticality",
      "extendibility",
      "non-bipartite graph"
    ],
    "tags": [
      "journal article"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2010arXiv1011.3381Z"
    }
  }
}