Connected factors in \(K_{1,n}\)-free graphs containing an \([a,b]\)-factor (Q2433740): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q3818315 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Connected \([a,b]\)-factors in \(K_{1,n}\)-free graphs containing an \([a,b]\)-factor / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Connected factors in \(K_{1,n}\)-free graphs containing a \((g,f)\)-factor / rank | |||
Normal rank |
Latest revision as of 22:26, 24 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Connected factors in \(K_{1,n}\)-free graphs containing an \([a,b]\)-factor |
scientific article |
Statements
Connected factors in \(K_{1,n}\)-free graphs containing an \([a,b]\)-factor (English)
0 references
30 October 2006
0 references
Let \(n\), \(a\), \(b\) be integers such that \(n \geq 3\), \(a \geq 1\) and \(a \leq b \leq a(n-2)+1\). Let \(G\) represent a connected \(K_{1,n}\)-free graph. If \(G\) has an \([a,b]\)-factor, then \(G\) has a connected \([a,b+n- \lceil b/a \rceil]\)-factor. The result is sharp: An example is given of such a \(G\) with an \([a,b]\)-factor but no connected \([a,b+n- \lceil b/a \rceil - 1]\)-factor, for \(b = ai\), \(1 \leq i \leq n-2\).
0 references
graph factor
0 references