Cycle-pancyclism in tournaments I

@article{GaleanaSnchez1995CyclepancyclismIT,
  title={Cycle-pancyclism in tournaments I},
  author={Hortensia Galeana-S{\'a}nchez and Sergio Rajsbaum},
  journal={Graphs and Combinatorics},
  year={1995},
  volume={11},
  pages={233-243}
}
LetT be a hamiltonian tournament withn vertices andγ a hamiltonian cycle ofT. In this paper we start the study of the following question: What is the maximum intersection withγ of a cycle of lengthk? This number is denotedf(n, k). We prove that fork in range, 3 ≤k ≤n + 4/2,f(n,k) ≥ k − 3, and that the result is best possible; in fact, a characterization of the values ofn, k, for whichf(n, k) = k − 3 is presented.In a forthcoming paper we studyf(n, k) for the case of cycles of lengthk > n + 4/2. 

Topics from this paper.

Citations

Publications citing this paper.
SHOWING 1-5 OF 5 CITATIONS

A conjecture on cycle-pancyclism in tournaments

  • Discussiones Mathematicae Graph Theory
  • 1998
VIEW 5 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Cycle-pancyclism in bipartite tournaments I

  • Discussiones Mathematicae Graph Theory
  • 2004
VIEW 1 EXCERPT
CITES BACKGROUND

Similar Papers

Loading similar papers…