Semiregular factorization of simple graphs (Q2566909): Difference between revisions

Let a \((d,d+s)\)-graph be a graph with vertex valency only in the inteval \([d,d+s]\) for \(d,s\geq 0\). Any \((d,d+1)\)-graph is said to be semiregular. For integers \(r,s\geq 0\), let \(\phi(r,s)\) be the least integer such that for any simple \((d,d+s)\)-graph \(G\), \(d\geq \phi(r,s)\) implies that \(G\) has a \((r,r+1)\)-factorization. Although the existence of \(\phi(r,s)\) was shown for any \(r\) by some authors, the authors of this paper show that \(\phi(r,s)=r(r+s+1)\) for \(r\geq 2\) while the other cases of \(s=0\) and \(1\) were known. This result is rather nice.