Binding numbers and \(f\)-factors of graphs (Q1193563): Difference between revisions

The authors study conditions on the binding number and on the minimum degree of a graph \(G\) which guarantee the existence of an \(f\)-factor in \(G\). Recall that I. Anderson proved that any graph of an even order with binding number \(\text{bind}(G)\geq 4/3\) has a 1-factor. D. R. Woodall proved that \(\text{bind}(G)\geq 3/2\) implies the existence of a 2-factor. The authors present the following results: Let \(G\) be a connected graph of order \(n\), \(a\) and \(b\) integers such that \(1\leq a\leq b\), \(2\leq b\), \(f:V(G)\to\{a,a+1,\dots,b\}\) a function with \(\Sigma(f(x)\); \(x\in V(G))\equiv 0\pmod 2\). If \[ \text{bind}(G)\geq(a+b-1)(n-1)/(an-(a+b)+3) \] and \(n\geq (a+b)^ 2/a\), then \(G\) has an \(f\)-factor. A similar assertion is also proved for minimum degrees.