3-Factor-criticality of vertex-transitive graphs

Heping Zhang, Wuyang Sun

A graph of order $n$ is $p$-factor-critical, where $p$ is an integer of the same parity as $n$, if the removal of any set of $p$ vertices results in a graph with a perfect matching…