Related papers: On explicit random-like tournaments

We prove that there exists a constant $c > 0$ such that the vertices of every strongly $c \cdot kt$-connected tournament can be partitioned into $t$ parts, each of which induces a strongly $k$-connected tournament. This is clearly tight up…

Reid conjectured that any finite set of non-negative integers is the score set of some tournament and Yao gave a non-constructive proof of Reid's conjecture using arithmetic arguments. No constructive proof has been found since. In this…

A graph is called odd if there is an orientation of its edges and an automorphism that reverses the sense of an odd number of its edges, and even otherwise. Pontus von Br\"omssen (n\'e Andersson) showed that the existence of such an…

Given a finite sequence of events and a well-defined notion of events being interesting, the Odds-theorem (Bruss (2000)) gives an online strategy to stop on the last interesting event. It is optimal for independent events. Here we study…

As a directed analog of Sidorenko's conjecture in extremal graph theory, Fox, Himwich, Zhou, and the second author defined an oriented graph $H$ to be tournament Sidorenko (anti-Sidorenko) if the random tournament asymptotically minimizes…

In 1962, Erd\H{o}s gave a sufficient condition for Hamilton cycles in terms of the vertex number, edge number, and minimum degree of graphs which generalized Ore's theorem. One year later, Moon and Moser gave an analogous result for…

In this paper spectral theorems for not necessarily continuous normal and self-adjoint random operators on a complex separable Hilbert space are proved.

We consider the following problem posed by Volkmann in 2007: How close to regular must a c-partite tournament be, to secure a strongly connected subtournament of order $c$? We give sufficient conditions on the regularity of balanced…

We describe an Aldous--Hoover-type characterization of random relational structures that are exchangeable relative to a fixed structure which may have various equivalence relations. Our main theorem gives the common generalization of the…

We show that a number of conditions on oriented graphs, all of which are satisfied with high probability by randomly oriented graphs, are equivalent. These equivalences are similar to those given by Chung, Graham and Wilson in the case of…

In this paper, we investigate the notions of almost Noetherian rings and modules. In details, we give the Cohen type theorem, Eakin-Nagata type theorem, Kaplansky type Theorem and Hilbert basis theorem and some other rings constructions for…

We revisit the game in which each of several players chooses a pattern and then a coin is flipped repeatedly until one of these patterns is generated. In particular, we demonstrate how to compute the probability of any one player winning…

In this paper we bring a novel approach to the theory of tournament rankings. We combine two different theories that are widely used to establish rankings of populations after a given tournament. First, we use the statistical approach of…

We use the theory of graph limits to study several quasi-random properties, mainly dealing with various versions of hereditary subgraph counts. The main idea is to transfer the properties of (sequences of) graphs to properties of graphons,…

Tournaments are competitions between a number of teams, the outcome of which determines the relative strength or rank of each team. In many cases, the strength of a team in the tournament is given by a score. Perhaps, the most striking…

We show that if $D$ is a tournament of arbitrary size then $D$ has finite strong components after reversing a locally finite sequence of cycles. In turn, we prove that any tournament can be covered by two acyclic sets after reversing a…

We introduce a connection between Newhouse thickness and patterns through a variant of Schmidt's game introduced by Broderick, Fishman and Simmons. This yields an explicit, robust and checkable condition that ensures the presence of…

We give a new proof of the Adams-Riemann-Roch theorem for a smooth projective morphism $X\to Y$, in the situation where $Y$ is a regular scheme, which is quasi-projective over $\mF_p$. We also partially answer a question of B. K\"ock.

We take the first steps to develop Conley-Zehnder Theory, as conjectured by Arnold, in the world of probability. As far as we know, this paper provides the first probabilistic theorems about the density of fixed points of symplectic twist…

A fundamental problem with the Nash equilibrium concept is the existence of certain "structurally deficient" equilibria that (i) lack fundamental robustness properties, and (ii) are difficult to analyze. The notion of a "regular" Nash…