For a graph G and a spanning subgraph H of G, H is called a \(P_{\ge t}\) -factor of G if each component of H is isomorphic to some path of order at least t, where \(t\ge 2\) is an integer. For any distinct edges e and f of G, if there is a \(P_{\ge t}\) -factor containing e and excluding f, then G is called \(P_{\ge t}\) -factor uniform. In this note, we give some binding number conditions for graphs to be \(P_{\ge 3}\) -factor uniform, which improve some known results.
