A degree condition for the existence of \(k\)-factors with prescribed properties (Q2570933): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 07:37, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A degree condition for the existence of \(k\)-factors with prescribed properties |
scientific article |
Statements
A degree condition for the existence of \(k\)-factors with prescribed properties (English)
0 references
31 October 2005
0 references
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.
0 references
