[Lowerbounds, Upperbounds]

Algorithms are everywhere.

Title: Graphs containing triangles are not 3-common
Speaker: Michael Young
When: November 1, 16:30-17:30
Where: Wean Hall 5302

Abstract:
Jagger, Stovicek and Thomason defined the class of k-common graphs, and showed among other results that every graph containing K_4 as a subgraph is not 2-common. We prove that every graph containing K_3 as a subgraph is not 3-common.