Related papers: Sidorenko property and forcing in regular tourname…
We extend the list of tournaments $S$ for which the complete structural description for tournaments excluding $S$ as a subtournament is known. Specifically, let $\Delta(1, 2, 2)$ be a tournament on five vertices obtained from a cyclic…
Thomason [$\textit{Trans. Amer. Math. Soc.}$ 296.1 (1986)] proved that every sufficiently large tournament contains Hamilton paths and cycles with all possible orientations, except possibly the consistently oriented Hamilton cycle. This…
While generic competitive systems exhibit mixtures of hierarchy and cycles, real-world systems are predominantly hierarchical. We demonstrate and extend a mechanism for hierarchy; systems with similar agents approach perfect hierarchy in…
The main theme of this paper is a relative version of the almost existence theorem for periodic orbits of autonomous Hamiltonian systems. We show that almost all low levels of a function on a geometrically bounded symplectically aspherical…
The study aims to compare different designs for the World Men's Handball Championships. This event, organised in every two years, has adopted four hybrid formats consisting of knockout and round-robin stages in recent decades, including a…
The Kolmogorov complexity function K can be relativized using any oracle A, and most properties of K remain true for relativized versions. In section 1 we provide an explanation for this observation by giving a game-theoretic interpretation…
This paper aims to explore the impact of tournament design on the incentives of the contestants. We develop a simulation framework to quantify the potential gain and loss from attacking based on changes in the probability of reaching the…
We revisit the well-studied problem of designing fair and manipulation-resistant tournament rules. In this problem, we seek a mechanism that (probabilistically) identifies the winner of a tournament after observing round-robin play among…
The famous Sidorenko's conjecture asserts that for every bipartite graph $H$, the number of homomorphisms from $H$ to a graph $G$ with given edge density is minimized when $G$ is pseudorandom. We prove that for any graph $H$, a graph…
We show that, for a natural notion of quasirandomness in $k$-uniform hypergraphs, any quasirandom $k$-uniform hypergraph on $n$ vertices with constant edge density and minimum vertex degree $\Omega(n^{k-1})$ contains a loose Hamilton cycle.…
The regularity lemma of Szemeredi asserts that one can partition every graph into a bounded number of quasi-random bipartite graphs. In some applications however, one would like to have a strong control on how quasi-random these bipartite…
In 2000 Allen Schwenk, using a well-known mathematical model of matchplay tournaments in which the probability of one player beating another in a single match is fixed for each pair of players, showed that the classical single-elimination,…
Uniformly quasiconformally homogeneous domains in $\mathbb{R}^n$ carry a transitive collection of $K$-quasiconformal maps for a fixed $K\geq 1.$ In this paper, we study two questions in this setting. The first is to show that…
Real world tournaments are almost always intransitive. Recent works have noted that parametric models which assume $d$ dimensional node representations can effectively model intransitive tournaments. However, nothing is known about the…
We consider variational Mean Field Games endowed with a constraint on the maximal density of the distribution of players. Minimizers of the variational formulation are equilibria for a game where both the running cost and the final cost of…
The celebrated Erd\"{o}s-Hajnal conjecture states that for every undirected graph $H$ there exists $ \epsilon(H) > 0 $ such that every undirected graph on $ n $ vertices that does not contain $H$ as an induced subgraph contains a clique or…
The density property for a Stein manifold X implies that the group of holomorphic diffeomorphisms of X is infinite-dimensional and, in a certain well-defined sense, as large as possible. We prove that if G is a complex semisimple Lie group…
K\"uhn, Osthus, and Townsend asked whether there exists a constant $C$ such that every strongly $Ct$-connected tournament contains all possible $1$-factors with at most $t$ components. We answer this question in the affirmative. This is…
One of the main questions that arise when studying random and quasi-random structures is which properties P are such that any object that satisfies P "behaves" like a truly random one. In the context of graphs, Chung, Graham, and Wilson…
We give several results showing that different discrete structures typically gain certain spanning substructures (in particular, Hamilton cycles) after a modest random perturbation. First, we prove that adding linearly many random edges to…