regular tournament
Recently Published Documents


TOTAL DOCUMENTS

11
(FIVE YEARS 0)

H-INDEX

3
(FIVE YEARS 0)

10.37236/7759 ◽  
2019 ◽  
Vol 26 (4) ◽  
Author(s):  
Lina Li ◽  
Theodore Molla

Both Cuckler and Yuster independently conjectured that when $n$ is an odd positive multiple of $3$ every regular tournament on $n$ vertices contains a collection of $n/3$ vertex-disjoint copies of the cyclic triangle. Soon after, Keevash \& Sudakov proved that if $G$ is an orientation of a graph on $n$ vertices in which every vertex has both indegree and outdegree at least $(1/2 - o(1))n$, then there exists a collection of vertex-disjoint cyclic triangles that covers all but at most $3$ vertices. In this paper, we resolve the conjecture of Cuckler and Yuster for sufficiently large $n$.



2017 ◽  
Vol 26 (5) ◽  
pp. 775-796
Author(s):  
RAPHAEL YUSTER

For an orientation H with n vertices, let T(H) denote the maximum possible number of labelled copies of H in an n-vertex tournament. It is easily seen that T(H) ≥ n!/2e(H), as the latter is the expected number of such copies in a random tournament. For n odd, let R(H) denote the maximum possible number of labelled copies of H in an n-vertex regular tournament. In fact, Adler, Alon and Ross proved that for H=Cn, the directed Hamilton cycle, T(Cn) ≥ (e−o(1))n!/2n, and it was observed by Alon that already R(Cn) ≥ (e−o(1))n!/2n. Similar results hold for the directed Hamilton path Pn. In other words, for the Hamilton path and cycle, the lower bound derived from the expectation argument can be improved by a constant factor. In this paper we significantly extend these results, and prove that they hold for a larger family of orientations H which includes all bounded-degree Eulerian orientations and all bounded-degree balanced orientations, as well as many others. One corollary of our method is that for any fixed k, every k-regular orientation H with n vertices satisfies T(H) ≥ (ek−o(1))n!/2e(H), and in fact, for n odd, R(H) ≥ (ek−o(1))n!/2e(H).



Author(s):  
Ilhan Hacioglu ◽  
T. Michael ◽  
Serhat Ozdemir

Fletcher asked whether there is a (0, 1)-matrix of order greater than 3 whose square is a regular tournament matrix. We give a negative answer for a special class of regular tournament matrices: There is no (0, 1)-matrix of order greater than 3 whose square is a doubly regular tournament matrix.





2000 ◽  
Vol 37 (2) ◽  
pp. 534-539 ◽  
Author(s):  
Yoshiaki Itoh ◽  
Hiroshi Maehara ◽  
Norihide Tokushige

Extending the cascade model for food webs, we introduce a cyclic cascade model which is a random generation model of cyclic dominance relations. Put n species as n points Q1,Q2,…, Qn on a circle. If the counterclockwise way from Qi to Qj on the circle is shorter than the clockwise way, we say Qi dominates Qj. Consider a tournament whose dominance relations are generated from the points on a circle by this rule. We show that when we take n mutually independently distributed points on the circle, the probability of getting a regular tournament of order 2r+1 as the largest regular tournament is equal to (n/(2r+1))/2n-1. This probability distribution is for the number of existing species after a sufficiently long period, assuming a Lotka-Volterra cyclic cascade model.



2000 ◽  
Vol 37 (02) ◽  
pp. 534-539 ◽  
Author(s):  
Yoshiaki Itoh ◽  
Hiroshi Maehara ◽  
Norihide Tokushige

Extending the cascade model for food webs, we introduce a cyclic cascade model which is a random generation model of cyclic dominance relations. Put n species as n points Q 1,Q 2,…, Q n on a circle. If the counterclockwise way from Q i to Q j on the circle is shorter than the clockwise way, we say Q i dominates Q j . Consider a tournament whose dominance relations are generated from the points on a circle by this rule. We show that when we take n mutually independently distributed points on the circle, the probability of getting a regular tournament of order 2r+1 as the largest regular tournament is equal to (n/(2r+1))/2 n-1. This probability distribution is for the number of existing species after a sufficiently long period, assuming a Lotka-Volterra cyclic cascade model.



2000 ◽  
Vol 306 (1-3) ◽  
pp. 103-121 ◽  
Author(s):  
Carolyn Eschenbach ◽  
Frank Hall ◽  
Rohan Hemasinha ◽  
Stephen J. Kirkland ◽  
Zhongshan Li ◽  
...  




Author(s):  
Noboru Ito

AbstractThe purpose of this note is to determine the automorphism group of the doubly regular tournament of Szekeres type, and to use it to show that the corresponding skew Hadamard matrix H of order 2(q + 1), where q ≡5(mod 8) and q > 5, is not equivalent to the skew Hadamard matrix H(2q + 1) of quadratic residue type when 2q + 1 is a prime power.



1977 ◽  
Vol 16 (2) ◽  
pp. 273-278 ◽  
Author(s):  
W.J.R. Eplett

A generating function is derived for the number of transitions to the first passage through a particular vertex of a random walk on a doubly regular tournament. As an application of this result, we obtain a generating function for the number of solutions (q1, …, qk) of qi ≡ r (mod p), where p is a prime of the form 4l + 3 and the qi are quadratic residues modulo p.



Sign in / Sign up

Export Citation Format

Share Document