Zanbo Zhang, Xiaoyan Zhang, Dingjun Lou, Xuelian Wen
Published 2017-07-23Version 1
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$.
Comments: 13 pages, 8 figures, published in Graphs and Combinatorics
On linear sets of minimum size
The maximum and the minimum size of complete (n,3)-arcs in PG(2,16)
On the minimum size of linear sets
![QR code for arXiv:1707.07288 [math.CO]](http://oss.arxitics.com/images/favicon.svg)