Department of

# Mathematics

Seminar Calendar
for events the day of Monday, May 21, 2018.

.
events for the
events containing

Questions regarding events or the calendar should be directed to Tori Corkery.
      April 2018              May 2018              June 2018
Su Mo Tu We Th Fr Sa   Su Mo Tu We Th Fr Sa   Su Mo Tu We Th Fr Sa
1  2  3  4  5  6  7          1  2  3  4  5                   1  2
8  9 10 11 12 13 14    6  7  8  9 10 11 12    3  4  5  6  7  8  9
15 16 17 18 19 20 21   13 14 15 16 17 18 19   10 11 12 13 14 15 16
22 23 24 25 26 27 28   20 21 22 23 24 25 26   17 18 19 20 21 22 23
29 30                  27 28 29 30 31         24 25 26 27 28 29 30



Monday, May 21, 2018

1:00 pm in 345 Altgeld Hall,Monday, May 21, 2018

#### Colorings of finite subgraphs of the universal k-clique-free graphs

###### Natasha Dobrinen (University of Denver)

Abstract: It is a central question in the theory of homogeneous relational structures as to which structures have finite big Ramsey degrees. This question, of interest for several decades, has gained recent momentum as it was brought into focus by Kechris, Pestov, and Todorčević in 2005. An infinite structure $S$ is homogeneous if any isomorphism between two finitely generated substructures of $S$ can be extended to an automorphism of $S$. A homogeneous structure $S$ is said to have finite big Ramsey degrees if for each finite substructure $A$ of $S$, there is a number $n$, depending on $A$, such that any coloring of the copies of $A$ in $S$ into finitely many colors can be reduced down to no more than $n$ colors on some substructure $S'$ isomorphic to $S$. This is interesting not only as a Ramsey property for infinite structures, but also because of its implications for topological dynamics.
Prior to work of the speaker, finite big Ramsey degrees had been proved for a handful of homogeneous structures: the rationals (Devlin 1979) the Rado graph (Sauer 2006), ultrametric spaces (Nguyen Van Thé 2008), and enriched versions of the rationals and related circular directed graphs (Laflamme, Nguyen Van Thé, and Sauer 2010). According to Nguyen Van Thé , "so far, the lack of tools to represent ultrahomogeneous structures is the major obstacle towards a better understanding of their infinite partition properties." We address this obstacle by providing new tools to represent the universal $k$-clique-free graphs and developing the necesshary Ramsey theory to deduce finite big Ramsey degrees. The methods developed seem robust enough that correct modifications should likely apply to a large class of homogeneous structures omitting some finite substructures.