15,190 research outputs found
Ramsey precompact expansions of homogeneous directed graphs
In 2005, Kechris, Pestov and Todorcevic provided a powerful tool to compute
an invariant of topological groups known as the universal minimal flow,
immediately leading to an explicit representation of this invariant in many
concrete cases. More recently, the framework was generalized allowing for
further applications, and the purpose of this paper is to apply these new
methods in the context of homogeneous directed graphs.
In this paper, we show that the age of any homogeneous directed graph allows
a Ramsey precompact expansion. Moreover, we verify the relative expansion
properties and consequently describe the respective universal minimal flows
Density theorems for bipartite graphs and related Ramsey-type results
In this paper, we present several density-type theorems which show how to
find a copy of a sparse bipartite graph in a graph of positive density. Our
results imply several new bounds for classical problems in graph Ramsey theory
and improve and generalize earlier results of various researchers. The proofs
combine probabilistic arguments with some combinatorial ideas. In addition,
these techniques can be used to study properties of graphs with a forbidden
induced subgraph, edge intersection patterns in topological graphs, and to
obtain several other Ramsey-type statements
Induced Ramsey-type theorems
We present a unified approach to proving Ramsey-type theorems for graphs with
a forbidden induced subgraph which can be used to extend and improve the
earlier results of Rodl, Erdos-Hajnal, Promel-Rodl, Nikiforov, Chung-Graham,
and Luczak-Rodl. The proofs are based on a simple lemma (generalizing one by
Graham, Rodl, and Rucinski) that can be used as a replacement for Szemeredi's
regularity lemma, thereby giving much better bounds. The same approach can be
also used to show that pseudo-random graphs have strong induced Ramsey
properties. This leads to explicit constructions for upper bounds on various
induced Ramsey numbers.Comment: 30 page
- …