Containers in Combinatorics

Add to your list(s) Download to your calendar using vCal

• Andrew Thomason (University of Cambridge)
• Wednesday 08 February 2017, 16:00-17:00
• Lecture room A, Watson building.

If you have a question about this talk, please contact Simon Goodwin.

A hypergraph with vertex set, say, {1,2,...,n} is a collection of subsets of the vertex set of some fixed size – these subsets are called edges. For example, the subsets might be all triples that form an arithmetic progression. An independent set in the hypergraph is a subset of the vertices that contain no edge – in the example, it would be a set of integers containing no 3-AP. It has recently been discovered that the independent sets in any hypergraph must be structured in some way: they are all contained within one of a small collection of “independent-like” subsets. We shall discuss this discovery and its applications.

This talk is part of the Mathematics Colloquium series.

This talk is included in these lists:

• Lecture room A, Watson building

Note that ex-directory lists are not shown.