no. 17 · Wednesday 18 November 2026
The minimum degree of minimally k-extendable graphs for some k
Abstract
A graph on at least 2k+2 vertices is k-extendable if every matching of size k extends to a perfect matching, and it is minimally k-extendable if it is k-extendable but deleting any edge is not. Plummer proved that every k-extendable graph is (k+1)-connected. So its minimum degree is at least k+1. Lou and Yu conjectured that a minimally k-extendable graph on at most 4k vertices has minimum degree in {k+1,2k,2k+1}; the case k=1 and the claw-free case of k=2 have been settled previously. We determine the minimum degree of minimally k-extendable graphs for k=2 and k=3, thereby settling the Lou–Yu conjecture for these two values. For k=2 the minimum degree is in {3,4,5}. For k=3 it is in {4,7} at orders 8 and 10, and in {4,6,7} at order 12. The proofs pass to the complement graph and combine Tutte's perfect matching theorem with a classification of four-vertex and six-vertex obstructions. All predicted values are realized by explicit constructions.
- comments
- 12 pages, 1 figure. Submitted to Graphs and Combinatorics
- fields
- Combinatorics