An extreme problem concerning k-arc-cyclic property for a class of tournaments (Q757403): Difference between revisions
From MaRDI portal
Changed an Item |
Set OpenAlex properties. |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Cycles of Each Length in Regular Tournaments / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Arc-Pancyclic Property of Tournaments under Some Degree Conditions / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/0012-365x(90)90386-v / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2079157310 / rank | |||
Normal rank |
Latest revision as of 12:15, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | An extreme problem concerning k-arc-cyclic property for a class of tournaments |
scientific article |
Statements
An extreme problem concerning k-arc-cyclic property for a class of tournaments (English)
0 references
1990
0 references
For fixed integers q and k let \(N=N(q,k)\) denote the smallest integer with the following property: if \(T_ n\) is a tournament with \(n\geq N\) nodes in which \(d^+(v)+d^-(u)\leq n-q\) for every arc uv of \(T_ n\), then every arc of \(T_ n\) belongs to a k-cycle. The authors show that \(N(q,4)=5q-7\) for \(q>1\) and they determine N(q,5) to within one when \(q\geq 15\).
0 references
cycles
0 references
degrees
0 references
tournament
0 references