Minimum size of n-factor-critical graphs and k-extendable graphs
Zan‐Bo Zhang, Xiaoyan Zhang, Dingjun Lou, Xuelian Wen · arXiv (Cornell University) · 2017
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$.