A degree condition for the existence of \(k\)-factors with prescribed properties (Q2570933): Difference between revisions

Summary: Let \(k\) be an integer such that \(k\geq 3\), and let \(G\) be a 2-connected graph of order \(n\) with \(n\geq 4k+1\), \(kn\) even, and minimum degree at least \(k+1\). We prove that if the maximum degree of each pair of nonadjacent vertices is at least \({n}/{2}\), then \(G\) has a \(k\)-factor excluding any given edge. The result of \textit{T. Nishimura} [J. Graph. Theory 16, 141--151 (1992; Zbl 0781.05039)] is improved.