"Ramsey theory and partially ordered sets" -
Imagine six random people meet at a party. Then either three of them know each other or there are three among them of whom each two have not met before.
This is one of the statements that can be deduced from Ramsey theory.
Ramsey's theorem states that we can always find a single-colored clique of given size in a complete (undirected) graph whose edges are labeled either blue or red, if the graph is sufficiently large. In general, determining the minimal number of vertices which is "sufficiently large" is an open problem. These numbers are called Ramsey numbers.
In this talk, we first discuss Ramsey's theorem, what is (un)known about Ramsey numbers. The second part of the talk concerns my research on a variation of the question for certain types of graphs that represent partially ordered sets.
Thursday, September 19, 2019 at 4:40pm to 5:30pm
3203 SE Woodstock Blvd, Portland, OR 97202, USA
Reed Community Members
If you are a member of the Reed community, you MUST LOG IN to see events that are open ONLY to the Reed community. Log in with your Reed ID (your Kerberos account information). If you don’t remember your account username or password, go to reed.edu/cis/help/kerberos.Log in with Reed ID