# Cycle-pancyclism in bipartite tournaments II

• Volume: 24, Issue: 3, page 529-538
• ISSN: 2083-5892

top

## Abstract

top
Let T be a hamiltonian bipartite tournament with n vertices, γ a hamiltonian directed cycle of T, and k an even number. In this paper the following question is studied: What is the maximum intersection with γ of a directed cycle of length k contained in T[V(γ)]? It is proved that for an even k in the range (n+6)/2 ≤ k ≤ n-2, there exists a directed cycle ${C}_{h\left(k\right)}$ of length h(k), h(k) ∈ k,k-2 with $|A\left({C}_{h\left(k\right)}\right)\cap A\left(\gamma \right)|\ge h\left(k\right)-4$ and the result is best possible. In a previous paper a similar result for 4 ≤ k ≤ (n+4)/2 was proved.

## How to cite

top

Hortensia Galeana-Sánchez. "Cycle-pancyclism in bipartite tournaments II." Discussiones Mathematicae Graph Theory 24.3 (2004): 529-538. <http://eudml.org/doc/270345>.

@article{HortensiaGaleana2004,
abstract = {Let T be a hamiltonian bipartite tournament with n vertices, γ a hamiltonian directed cycle of T, and k an even number. In this paper the following question is studied: What is the maximum intersection with γ of a directed cycle of length k contained in T[V(γ)]? It is proved that for an even k in the range (n+6)/2 ≤ k ≤ n-2, there exists a directed cycle $C_\{h(k)\}$ of length h(k), h(k) ∈ k,k-2 with $|A(C_\{h(k)\}) ∩ A(γ)| ≥ h(k)-4$ and the result is best possible. In a previous paper a similar result for 4 ≤ k ≤ (n+4)/2 was proved.},
author = {Hortensia Galeana-Sánchez},
journal = {Discussiones Mathematicae Graph Theory},
keywords = {bipartite tournament; pancyclism},
language = {eng},
number = {3},
pages = {529-538},
title = {Cycle-pancyclism in bipartite tournaments II},
url = {http://eudml.org/doc/270345},
volume = {24},
year = {2004},
}

TY - JOUR
AU - Hortensia Galeana-Sánchez
TI - Cycle-pancyclism in bipartite tournaments II
JO - Discussiones Mathematicae Graph Theory
PY - 2004
VL - 24
IS - 3
SP - 529
EP - 538
AB - Let T be a hamiltonian bipartite tournament with n vertices, γ a hamiltonian directed cycle of T, and k an even number. In this paper the following question is studied: What is the maximum intersection with γ of a directed cycle of length k contained in T[V(γ)]? It is proved that for an even k in the range (n+6)/2 ≤ k ≤ n-2, there exists a directed cycle $C_{h(k)}$ of length h(k), h(k) ∈ k,k-2 with $|A(C_{h(k)}) ∩ A(γ)| ≥ h(k)-4$ and the result is best possible. In a previous paper a similar result for 4 ≤ k ≤ (n+4)/2 was proved.
LA - eng
KW - bipartite tournament; pancyclism
UR - http://eudml.org/doc/270345
ER -

## References

top
1. [1] B. Alspach, Cycles of each length in regular tournaments, Canadian Math. Bull. 10 (1967) 283-286, doi: 10.4153/CMB-1967-028-6. Zbl0148.43602
2. [2] L.W. Beineke, A tour through tournaments or bipartite and ordinary tournaments: A comparative survey. J. London Math. Soc. Lect. Notes Ser. 52 (1981) 41-55.
3. [3] L.W. Beineke and V. Little, Cycles in bipartite tournaments, J. Combin. Theory (B) 32 (1982) 140-145, doi: 10.1016/0095-8956(82)90029-6. Zbl0465.05035
4. [4] C. Berge, Graphs and hypergraphs (North-Holland, Amsterdam, 1976).
5. [5] J.C. Bermond and C. Thomasen, Cycles in digraphs, A survey, J. Graph Theory 5 (1981) 145-147, doi: 10.1002/jgt.3190050102.
6. [6] H. Galeana-Sánchez and S. Rajsbaum, Cycle-Pancyclism in Tournaments I, Graphs and Combinatorics 11 (1995) 233-243, doi: 10.1007/BF01793009. Zbl0833.05039
7. [7] H. Galeana-Sánchez and S. Rajsbaum, Cycle-Pancyclism in Tournaments II, Graphs and Combinatorics 12 (1996) 9-16, doi: 10.1007/BF01858440. Zbl0844.05047
8. [8] H. Galeana-Sánchez and S. Rajsbaum, Cycle-Pancyclism in Tournaments III, Graphs and Combinatorics 13 (1997) 57-63, doi: 10.1007/BF01202236. Zbl0868.05028
9. [9] H. Galeana-Sánchez and S. Rajsbaum, A Conjecture on Cycle-Pancyclism in Tournaments, Discuss. Math. Graph Theory 18 (1998) 243-251, doi: 10.7151/dmgt.1080. Zbl0928.05031
10. [10] H. Galeana-Sanchez, Cycle-Pancyclism in Bipartite Tournaments I, Discuss. Math. Graph Theory 24 (2004) 277-290, doi: 10.7151/dmgt.1231. Zbl1063.05060
11. [11] G. Gutin, Cycles and paths in semicomplete multipartite digraphs, theorems and algorithms: A survey, J. Graph Theory 19 (1995) 481-505, doi: 10.1002/jgt.3190190405. Zbl0839.05043
12. [12] R. Häggkvist and Y. Manoussakis, Cycles and paths in bipartite tournaments with spanning configurations, Combinatorica 9 (1989) 33-38, doi: 10.1007/BF02122681. Zbl0681.05036
13. [13] L. Volkmann, Cycles in multipartite tournaments, results and problems, Discrete Math. 245 (2002) 19-53, doi: 10.1016/S0012-365X(01)00419-8. Zbl0996.05063
14. [14] C.Q. Zhang, Vertex even-pancyclicity in bipartite tournaments, J. Nanjing Univ. Math. Biquart 1 (1981) 85-88.
15. [15] K.M. Zhang and Z.M. Song, Cycles in digraphs, a survey, J. Nanjing Univ., Nat. Sci. Ed. 27 (1991) 188-215. Zbl0762.05064

## NotesEmbed?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.