Cycle-pancyclism in tournaments. I

DOI10.1007/BF01793009MaRDI QIDQ1900518zbMATH OpenOpenAlexFDO

Authors Hortensia Galeana-Sánchez, Sergio Rajsbaum

Publication date 6 May 1997

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

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

zbMATH Keywords

boundsspanning cycletournament

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Extremal problems in graph theory (05C35) Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45)

Review text

Let \(n\) and \(k\) be integers such that \(3\leq k\leq (n+ 4)/2\). The authors show that if \(C_n\) is a spanning cycle of a tournament \(T_n\), then there exists a \(k\)-cycle \(C_k\) in \(T_n\) such that \(C_k\) and \(C_n\) have at least \(k- 3\) or \(k- 2\) arcs in common, according as \(n\not\equiv k\) or \(n\equiv k\) modulo \(k- 2\). The bounds are sharp.

Recommendations

• Cycle-pancyclism in tournaments. III
• Cycle-pancyclism in bipartite tournaments II
• Cycle-pancyclism in tournaments. II
• Pancyclic in-tournaments
• A conjecture on cycle-pancyclism in tournaments

Cites work

• Cycles in digraphs– a survey
• Cycles of Each Length in Regular Tournaments

Cited in

(7)

• Cycles in team tennis and other paired-element contests
• Cycle-pancyclism in tournaments. II
• A conjecture on cycle-pancyclism in tournaments
• Pancyclic in-tournaments
• Cycle-pancyclism in tournaments. III
• A characterization of semitwin digraphs
• An extreme problem concerning k-arc-cyclic property for a class of tournaments

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

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