Related papers: Complete Mixed Doubles Round Robin Tournaments

We consider a tournament $T=(V, A)$. For $X\subseteq V$, the subtournament of $T$ induced by $X$ is $T[X] = (X, A \cap (X \times X))$. An interval of $T$ is a subset $X$ of $V$ such that for $a, b\in X$ and $ x\in V\setminus X$, $(a,x)\in…

There are several approaches for using computers in deriving mathematical proofs. For their illustration, we provide an in-depth study of using computer support for proving one complex combinatorial conjecture -- correctness of a strategy…

Every sport needs rules. Tournament design refers to the rules that determine how a tournament, a series of games between a number of competitors, is organized. This study aims to provide an overview of the tournament design literature from…

A long-standing conjecture of Kelly states that every regular tournament on n vertices can be decomposed into (n-1)/2 edge-disjoint Hamilton cycles. We prove this conjecture for large n. In fact, we prove a far more general result, based on…

Let $k,d,\lambda\geqslant1$ be integers with $d\geqslant\lambda $. Let $m(k,d,\lambda)$ be the maximum positive integer $n$ such that every set of $n$ points (not necessarily in general position) in $\mathbb{R}^{d}$ has the property that…

Let $k$ be an algebraically closed field of odd characteristic $p$, and let $D_n$ be the dihedral group of order $2n$ such that $p\mid 2n$. Let $D(kD_n)$ denote the quantum double of the group algebra $kD_n$. In this paper, we describe the…

Chen and Cheng [Ann. Statist. 34 (2006) 546--558] discussed the method of doubling for constructing two-level fractional factorial designs. They showed that for $9N/32\le n\le 5N/16$, all minimum aberration designs with $N$ runs and $n$…

Given $a,b,c\in\mathbb N$, let $D_{a,b,c}$ be the tournament on $a+b+c$ vertices obtained by replacing the vertices of the directed triangle $C_3$ with transitive tournaments $TT_a$, $TT_b$, and $TT_c$, respectively. Keevash and Sudakov…

Determining how close a winner of an election is to becoming a loser, or distinguishing between different possible winners of an election, are major problems in computational social choice. We tackle these problems for so-called weighted…

The normalized maximum likelihood (NML) is one of the most important distribution in coding theory and statistics. NML is the unique solution (if exists) to the pointwise minimax regret problem. However, NML is not defined even for simple…

We prove that for all natural numbers $m$ and $k$ where $k$ is odd, there exists a natural number $N(k)$ such that any 3-connected cubic graph with at least $N(k)$ vertices contains a cycle of length $m$ modulo $k$. We also construct a…

Single-elimination tournaments are the standard paradigm both for the main tennis professional associations. Schedules are generated by allocating first seeded and then unseeded players with seeds prevented from encountering each other…

A classic result due to Douglas establishes that, for odd spread $k$ and dimension $d=\frac{1}{2}(3k+3)$, all maximum length $(d,k)$ circuit codes are isomorphic. Using a recent result of Byrnes we extend Douglas's theorem to prove that,…

Given a tournament $T$, a module of $T$ is a subset $X$ of $V(T)$ such that for $x, y\in X$ and $v\in V(T)\setminus X$, $(x,v)\in A(T)$ if and only if $(y,v)\in A(T)$. The trivial modules of $T$ are $\emptyset$, $\{u\}$ $(u\in V(T))$ and…

The study of problems concerning subdivisions of graphs has a rich history in extremal combinatorics. Confirming a conjecture of Burr and Erd\H{o}s, Alon proved in 1994 that subdivided graphs have linear Ramsey numbers. Later, Alon,…

We generalize Rock Paper Scissors to complete directed graphs, or tournaments, on $n$ vertices. Properties of the mixed-strategy Nash equilibria of these tournaments are discussed, particularly those with Nash equilibria where all of the…

We construct a partitioned balanced tournament design of side nine.

Tournament solutions play an important role within social choice theory and the mathematical social sciences at large. We construct a tournament of order 36 for which the Banks set and the bipartisan set are disjoint. This implies that…

In sports competitions, teams can manipulate the result by, for instance, throwing games. We show that we can decide how to manipulate round robin and cup competitions, two of the most popular types of sporting competitions in polynomial…

We consider one-round games between a classical verifier and two provers who share entanglement. We show that when the constraints enforced by the verifier are `unique' constraints (i.e., permutations), the value of the game can be well…