Cycle-pancyclism in tournaments. III

DOI10.1007/BF01202236MaRDI QIDQ675888zbMATH OpenFDO

Authors Hortensia Galeana-Sánchez, Sergio Rajsbaum

Publication date 18 August 1997

Published in Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF01202236

zbMATH Keywords

tournament

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45)

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\).

Recommendations

• A conjecture on cycle-pancyclism in tournaments
• Cycle-pancyclism in tournaments. I
• Cycle-pancyclism in tournaments. II
• Pancyclic arcs and connectivity in tournaments

Cites work

• Cycle-pancyclism in tournaments. I
• Cycle-pancyclism in tournaments. II
• Cycles in digraphs– a survey
• Cycles of Each Length in Regular Tournaments

Cited in

(9)

• Cycles in team tennis and other paired-element contests
• Cycle-pancyclism in tournaments. I
• Cycle-pancyclism in tournaments. II
• On monochromatic paths and monochromatic cycles in edge coloured tournaments
• scientific article; zbMATH DE number 5371651 (Why is no real title available?)
• A conjecture on cycle-pancyclism in tournaments
• Pancyclic in-tournaments
• A characterization of semitwin digraphs
• Longest cycles in almost regular 3-partite tournaments

This page was built for publication: Cycle-pancyclism in tournaments. III

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q675888)