37 research outputs found
Excluding pairs of tournaments
The Erd\H{o}s-Hajnal conjecture states that for every given undirected graph
there exists a constant such that every graph that does not
contain as an induced subgraph contains a clique or a stable set of size at
least . The conjecture is still open. Its equivalent directed
version states that for every given tournament there exists a constant
such that every -free tournament contains a transitive
subtournament of order at least . We prove in this paper that
-free tournaments contain transitive subtournaments of
size at least for some and several
pairs of tournaments: , . In particular we prove that
-freeness implies existence of the polynomial-size transitive
subtournaments for several tournaments for which the conjecture is still
open ( stands for the \textit{complement of }). To the best of our
knowledge these are first nontrivial results of this type
Dominating the Erdos-Moser theorem in reverse mathematics
The Erdos-Moser theorem (EM) states that every infinite tournament has an
infinite transitive subtournament. This principle plays an important role in
the understanding of the computational strength of Ramsey's theorem for pairs
(RT^2_2) by providing an alternate proof of RT^2_2 in terms of EM and the
ascending descending sequence principle (ADS). In this paper, we study the
computational weakness of EM and construct a standard model (omega-model) of
simultaneously EM, weak K\"onig's lemma and the cohesiveness principle, which
is not a model of the atomic model theorem. This separation answers a question
of Hirschfeldt, Shore and Slaman, and shows that the weakness of the
Erdos-Moser theorem goes beyond the separation of EM from ADS proven by Lerman,
Solomon and Towsner.Comment: 36 page
Structure theorem for U5-free tournaments
Let be the tournament with vertices , ..., such that , and if , and
. In this paper we describe the tournaments which do not have
as a subtournament. Specifically, we show that if a tournament is
"prime"---that is, if there is no subset , , such that for all , either
for all or for all ---then is
-free if and only if either is a specific tournament or
can be partitioned into sets , , such that , ,
and are transitive. From the prime -free tournaments we can
construct all the -free tournaments. We use the theorem to show that every
-free tournament with vertices has a transitive subtournament with at
least vertices, and that this bound is tight.Comment: 15 pages, 1 figure. Changes from previous version: Added a section;
added the definitions of v, A, and B to the main proof; general edit
No additional tournaments are quasirandom-forcing
A tournament H is quasirandom-forcing if the following holds for every
sequence (G_n) of tournaments of growing orders: if the density of H in G_n
converges to the expected density of H in a random tournament, then (G_n) is
quasirandom. Every transitive tournament with at least 4 vertices is
quasirandom-forcing, and Coregliano et al. [Electron. J. Combin. 26 (2019),
P1.44] showed that there is also a non-transitive 5-vertex tournament with the
property. We show that no additional tournament has this property. This extends
the result of Bucic et al. [arXiv:1910.09936] that the non-transitive
tournaments with seven or more vertices do not have this property
Some results and problems on tournament structure
This paper is a survey of results and problems related to the following
question: is it true that if G is a tournament with sufficiently large
chromatic number, then G has two vertex-disjoint subtournaments A,B, both with
large chromatic number, such that all edges between them are directed from A to
B? We describe what we know about this question, and report some progress on
several other related questions, on tournament colouring and domination