On 4-cycles and 5-cycles in Regular Tournaments
نویسنده
چکیده
First, some definitions. A tournament is regular of degree k if each point has indegree k and outdegree k: clearly such a tournament has 2k +1 points. The trivial tournament has just one point. A tournament T is doubly regular with subdegree t if it is non-trivial and any two points of T jointly dominate precisely t points; equivalently if T is non-trivial and for each point v of T, the subtournament Tv on the points dominated by v is regular of degree /. By counting arcs in Tv we see that v has outdegree 2t +1 , and it follows that Tis regular of degree 2t+1. Reid and Brown [4] have shown that the existence of a doubly regular tournament with subdegree / is equivalent to the existence of a skew-Hadamard matrix of order At+4. The simplest examples of doubly regular tournaments are provided by the quadratic residue tournaments QRP, where p is a prime congruent to 3 modulo 4: the points of QRp are the p elements of the field Zp, and u dominates v if and only if u — v is a square inZp. Let m be an integer ^ 3. We say that a tournament T has property &m if T is non-trivial and each arc of T lies in the same non-zero number of w-cycles. It is well-known (see [4]) that a tournament has property ^ 3 if and only if it is doubly regular. Moreover, as we shall see, if such a tournament has more than three points then it also has properties ^4 and &h. Although a tournament with property ^ or 8Ph is necessarily regular, neither property alone is strong enough to ensure double regularity. To see this consider first the 9-point tournament Z3[Z3], defined as follows: it has three point-disjoint 3-cycles Cv C2, C3 and each point of Q dominates each point of Q+ 1 (where subscripts are reduced modulo 3). It is straightforward to check that this tournament has property ^4 but not ^3. Secondly, the 5-point tournament which is the union of two arc-disjoint 5-cycles has property ^ 5 but not ^3. We prove that a tournament which has both property ^4 and property &h is doubly regular. Our methods are algebraic and serve also to show that a regular tournament is doubly regular if and only if the minimal polynomial of its adjacency matrix has degree 3. 2. Some preliminary results
منابع مشابه
Weakly Complementary Cycles in 3-Connected Multipartite Tournaments
The vertex set of a digraph D is denoted by V (D). A c-partite tournament is an orientation of a complete c-partite graph. A digraph D is called cycle complementary if there exist two vertex disjoint cycles C1 and C2 such that V (D) = V (C1) ∪ V (C2), and a multipartite tournament D is called weakly cycle complementary if there exist two vertex disjoint cycles C1 and C2 such that V (C1) ∪ V (C2...
متن کاملOn Cycles Containing a Given Arc in Regular Multipartite Tournaments
In this paper we prove that if T is a regular n-partite tournament with n ≥ 4, then each arc of T lies on a cycle whose vertices are from exactly k partite sets for k = 4, 5, . . . , n. Our result, in a sense, generalizes a theorem due to Alspach.
متن کاملDisjoint 3 - cycles in tournaments : a proof of the 1 Bermond - Thomassen conjecture for tournaments ∗
5 We prove that every tournament with minimum out-degree at least 2k− 1 contains k disjoint 6 3-cycles. This provides additional support for the conjecture by Bermond and Thomassen that 7 every digraph D of minimum out-degree 2k − 1 contains k vertex disjoint cycles. We also prove 8 that for every > 0, when k is large enough, every tournament with minimum out-degree at least 9 (1.5+ )k contains...
متن کاملHamilton Decompositions of Regular Tournaments
We show that every sufficiently large regular tournament can almost completely be decomposed into edge-disjoint Hamilton cycles. More precisely, for each η > 0 every regular tournament G of sufficiently large order n contains at least (1/2− η)n edge-disjoint Hamilton cycles. This gives an approximate solution to a conjecture of Kelly from 1968. Our result also extends to almost regular tourname...
متن کاملA ug 2 00 9 HAMILTON DECOMPOSITIONS OF REGULAR TOURNAMENTS
We show that every sufficiently large regular tournament can almost completely be decomposed into edge-disjoint Hamilton cycles. More precisely, for each η > 0 every regular tournament G of sufficiently large order n contains at least (1/2 − η)n edge-disjoint Hamilton cycles. This gives an approximate solution to a conjecture of Kelly from 1968. Our result also extends to almost regular tournam...
متن کامل