2019
Apr
01

# Combinatorics: Raphy Yuster (U. Haifa) "On some Ramsey type problems in tournaments"

11:00am to 1:00pm

## Location:

CS B-500, Safra campus

Speaker: Raphy Yuster, U. Haifa
Title: On some Ramsey type problems in tournaments
Abstract:
I will talk about several Ramsey type problems in tournaments guaranteeing the existence of subgraphs with certain chromatic properties.
Here are two such problems which attracted some attention recently:
1. Let g(n) be the smallest integer such that every tournament with more than g(n) vertices has an *acyclic subgraph* with chromatic number larger than n.
It is straightforward that Omega(n) <= g(n) <= n^2. An improvement of both bounds is presented.