Fan-type results for the existence of [\(a\),\(b\)]-factors (Q2488945): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.disc.2006.01.018 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2056858863 / rank | |||
Normal rank | |||
Revision as of 21:55, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Fan-type results for the existence of [\(a\),\(b\)]-factors |
scientific article |
Statements
Fan-type results for the existence of [\(a\),\(b\)]-factors (English)
0 references
16 May 2006
0 references
Let \(1\leq a<b\) be integers and \(G\) a graph of order \(n\) sufficiently large for \(a\) and \(b\). Then \(G\) has an \([a,b]\)-factor if the minimum degree is at least \(a\) and every pair of vertices distance two apart has cardinality of the neighborhood union at least \(an/(a+b)\). This lower bound is sharp. As a consequence, we have a Fan-type condition for a graph to have an \([a,b]\)-factor.
0 references
neighborhood union
0 references
