<script type="text/javascript">
<!--
document.write('<div id="oa_widget"></div>');
document.write('<script type="text/javascript" src="https://www.openaire.eu/index.php?option=com_openaire&view=widget&format=raw&projectId=undefined&type=result"></script>');
-->
</script>
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)].
Extremal problems in graph theory, Directed graphs (digraphs), tournaments, cycles, In-tournaments, Theoretical Computer Science, pancyclicity, in-tournaments, Cycles, Discrete Mathematics and Combinatorics, Pancyclicity, Paths and cycles
Extremal problems in graph theory, Directed graphs (digraphs), tournaments, cycles, In-tournaments, Theoretical Computer Science, pancyclicity, in-tournaments, Cycles, Discrete Mathematics and Combinatorics, Pancyclicity, Paths and cycles
citations This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 7 | |
popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |