Binding number conditions for \(P_{\geq 2}\)-factor and \(P_{\geq 3}\)-factor uniform graphs (Q2286579)

For a graph $G$, a spanning subgraph $F$ of $G$ is called a $P_{\geq k}$-factor of $G$ if each component of $F$ is a path of order at least $k$, where $k\geq 2$ is an integer. The authors introduce the concept of $P_{\geq k}$-factor uniform graph, which is a graph such that for any two distinct edges $e$ and $f$ of the graph, it admits a $P_{\geq k}$-factor which includes $e$ but excludes $f$. In this paper, the authors use the graph parameter binding number to give sufficient conditions for a graph to be $P_{\geq 2}$-factor uniform and $P_{\geq 3}$-factor uniform, respectively.