Minimum size of n-factor-critical graphs and k-extendable graphs
classification
🧮 math.CO
keywords
graphsminimumsizedetermineextendablerelatedbipartiteconjecture
read the original 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$.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.