Sep. 7, 3:30pm, Wean 8220

Joseph Briggs, CMU

Inverting the Turán Problem

Joseph Briggs, CMU

Inverting the Turán Problem

Abstract:

Classical questions in graph theory ask about `ex`(*G*,*F*), the maximum number of edges in an *F*-free subgraph of *G*, for some ﬁxed
family *F* of graphs. For example, the Turán and Zarankiewicz problems ask about `ex`(*K _{n}*,

Before the talk, at 3:10pm, there will be tea and cookies in Wean 6220.