Fan-type results for the existence of [\(a\),\(b\)]-factors (Q2488945): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: New sufficient conditions for cycles in graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4376498 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Subgraphs with prescribed valencies / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A neighbourhood condition for graphs to have \([a,b]\)-factors / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4940059 / rank | |||
Normal rank | |||
Latest revision as of 14:03, 24 June 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
