|Title: Graphs and Hypercubes|
|Speaker: Eoin Long of University of Oxford|
|Contact: Dwight Duffus, email@example.com|
|Date: 2019-02-15 at 4:00PM|
|Venue: MSC W301|
Graphs and hypercubes are two of the most widely studied structures in Combinatorics. While interesting in their own right, this study is also motivated by their broad applicability, arising naturally in many areas including Discrete Geometry, Probability and Computer Science. In this talk I will discuss a number of questions and results concerning both of these structures, with an emphasis on interactions between the two. This will include topics in finite set theory, isoperimetric inequalities and Ramsey theory.
See All Seminars