A counterexample to a generalization of Richardson's theorem (Q1088675): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/0012-365x(87)90064-1 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2003191035 / rank | |||
Normal rank |
Latest revision as of 11:49, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A counterexample to a generalization of Richardson's theorem |
scientific article |
Statements
A counterexample to a generalization of Richardson's theorem (English)
0 references
1987
0 references
The following result has apparently been obtained by \textit{M. Kwasnik} in Discuss. Math. 4, 11-13 (1981; Zbl 0509.05048): If a finite digraph has no circuits of length \(nk+r\) for \(n=0,1,2,..\). and \(0<r<k\), then it has a k-kernel (k\(\geq 2\); Richardson's theorem refers to the case \(k=2).\) The present note shows that the result is not always valid for \(k>2\) unless an additional condition is imposed, such that the digraph be strongly connected [loc. cit.].
0 references
digraph
0 references
Richardson's theorem
0 references