Cycles in Multipartite Tournaments
โ Scribed by Y.B. Guo; L. Volkmann
- Publisher
- Elsevier Science
- Year
- 1994
- Tongue
- English
- Weight
- 132 KB
- Volume
- 62
- Category
- Article
- ISSN
- 0095-8956
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
We prove that every tournament of order n 68 contains every oriented Hamiltonian cycle except possibly the directed one when the tournament is reducible.
## Abstract In this paper we study multipartite Ramsey numbers for odd cycles. We formulate the following conjecture: Let __n__โฅ5 be an arbitrary positive odd integer; then, in any twoโcoloring of the edges of the complete 5โpartite graph __K__((__n__โ1)/2, (__n__โ1)/2, (__n__โ1)/2, (__n__โ1)/2, 1)
We consider a random rn by n bipartite tournament T, , consisting of rnn independent random arcs which have a common probability p of being directed from the rn part to the n part. We determine the expected value and variance of the number of 4-cycles in T,,,, and the probability that T, , has no cy