STOC 2024 Workshop: Applications of Turán-type Problems in Theoretical Computer Science

Header image of a spider weaving a graph as its web

When: Thursday June 27 and Friday June 28, 8:30-11am

Where: Sheraton Vancouver Wall Centre, Vancouver (STOC venue; room TBA)

What: In extremal combinatorics, a Turán-type problem is one that asks for the maximum possible size of a combinatorial system – such as a graph, hypergraph, or matrix – that avoids one or more forbidden patterns. Continue Reading »