Factor domination and minimum degree (Q1868841): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
(One intermediate revision by one other user not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/s0012-365x(02)00522-8 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2024119741 / rank | |||
Normal rank |
Latest revision as of 11:15, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Factor domination and minimum degree |
scientific article |
Statements
Factor domination and minimum degree (English)
0 references
28 April 2003
0 references
As their main result the authors prove the best-possible estimate \(\gamma(F_1,F_2)\leq \frac{2}{3}n\) where \(F_1\) and \(F_2\) are factors of the complete graph \(K_n\) of order \(n\) that have minimum degree at least \(1\). The proof idea also yields an upper bound of the factor domination number of \(k\geq 2\) factors of \(K_n\) of minimum degree \(1\). The second main result is an upper bound on \(\gamma(F_1,F_2,\dots ,F_k)\) in terms of the least minimum degree \(\delta\) of the factors, their number \(k\) and their order \(n\) that is proved using a well-known probabilistic argument.
0 references
domination
0 references
factor
0 references