|Title: Extremal Problems for Graphs and Hypergraphs|
|Speaker: Bill Kay of Emory University|
|Contact: Bill Kay, firstname.lastname@example.org|
|Date: 2017-03-21 at 4:00PM|
We discuss a pair of papers in extremal combinatorics. One establishes asymptotically the chromatic number of the so-called type graphs, and the other investigates a certain property of oriented hypergraphs (Property O).
See All Seminars