Cycle-pancyclism in tournaments. III
type: Item
instance of: scholarly article
title: Cycle-pancyclism in tournaments. III
zbMATH Open document ID: 0868.05028
DOI: 10.1007/BF01202236
author: Hortensia Galeana-Sánchez
author: Sergio Rajsbaum
published in: Graphs and Combinatorics
publication date: 1997-08-18T00:00:00Z
review text: Let \(f(n,k)\) denote the largest integer \(h\) such that for any \(n\)-cycle of any strong tournament \(T_n\), there exists some \(k\)-cycle that has at least \(h\) arcs in common with the \(n\)-cycle. The authors have investigated the values of \(f(n,k)\) in two earlier papers [Graphs Comb. 11, 233-243 (1995; Zbl 0833.05039); and 12, No. 1, 9-16 (1996; Zbl 0844.05047)]. They complete their description of \(f(n,k)\) in the present paper by showing that \(f(n,k)= k-4\) if and only if \(n\leq 2k-5\) and \(5<k<n\).
reviewed by: J. W. Moon
Mathematics Subject Classification ID: 05C20
Mathematics Subject Classification ID: 05C38
Mathematics Subject Classification ID: 05C45
zbMATH DE Number: 989829
zbMATH Keywords: tournament
MaRDI profile type: Publication
cites work: Cycles of Each Length in Regular Tournaments
cites work: Cycles in digraphs– a survey
cites work: Cycle-pancyclism in tournaments. I
cites work: Cycle-pancyclism in tournaments. II
description: scientific article; zbMATH DE number 989829