|
Session 27. Probabilistic and Extremal Combinatorics
|
Ramsey theorems for random structures |
Angelika Steger, ETH Zürich, Switzerland
|
The talk is based on the joint work with Rajko Nenadov and Nemanja Skoric
|
|
|
In this talk we consider various versions of Ramsey-type questions in a random graph setting: the classical Ramsey problem,
anti-Ramsey questions, Maker-Breaker games. It is easy to see that one should expect the same threshold (namely, the \(m_2\)-density of the forbidden graph \(F\)) for all these problems. The aim of this talk is to provide a general framework for proving 0-statements and to then apply it to the three problems mentioned above. We also provide an extension to hypergraphs.
|
|
| Print version |
|
