Vertex 6-pancyclic in-tournaments (Q1877667): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
(One intermediate revision by one other user not shown) | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/j.disc.2004.03.010 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1963581070 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: In-tournament digraphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3267901 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On Subtournaments of a Tournament / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q2756071 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Pancyclic in-tournaments / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Pancyclic orderings of in-tournaments / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4222094 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Vertex pancyclic in-tournaments / rank | |||
Normal rank |
Latest revision as of 20:08, 6 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Vertex 6-pancyclic in-tournaments |
scientific article |
Statements
Vertex 6-pancyclic in-tournaments (English)
0 references
19 August 2004
0 references
An in-tournament is an oriented graph in which the in-neighbourhood of every vertex induces a tournament. The main result in this paper is that if \(D\) is a strong in-tournament of order \(n\geq 6\) \((n\neq 14,15,16)\) and minimum degree greater than \((16n-39)/73\), then every vertex of \(D\) belongs to a cycle of each length between 6 and \(n\), inclusive. This result is a special case of a conjecture of \textit{M. Tewes} and \textit{L. Volkmann} [J. Graph Theory 36, No. 2, 84--104 (2001; Zbl 0971.05052)].
0 references
in-tournaments
0 references
pancyclicity
0 references
cycles
0 references