{
  "id": "1707.07288",
  "version": "v1",
  "published": "2017-07-23T12:14:07.000Z",
  "updated": "2017-07-23T12:14:07.000Z",
  "title": "Minimum size of n-factor-critical graphs and k-extendable graphs",
  "authors": [
    "Zanbo Zhang",
    "Xiaoyan Zhang",
    "Dingjun Lou",
    "Xuelian Wen"
  ],
  "comment": "13 pages, 8 figures, published in Graphs and Combinatorics",
  "categories": [
    "math.CO"
  ],
  "abstract": "We determine the minimum size of $n$-factor-critical graphs and that of $k$-extendable bipartite graphs, by considering Harary graphs and related graphs. Moreover, we determine the minimum size of $k$-extendable non-bipartite graphs for $k=1,\\ 2$, and pose a related conjecture for general $k$.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2017-07-23T12:14:07.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "minimum size",
      "n-factor-critical graphs",
      "k-extendable graphs",
      "extendable non-bipartite graphs",
      "extendable bipartite graphs"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 13,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}