BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//talks.bham.ac.uk//v3//EN
BEGIN:VEVENT
CATEGORIES:Mathematics Colloquium
SUMMARY:Containers in Combinatorics - Andrew Thomason (Uni
versity of Cambridge)
DTSTART:20170208T160000Z
DTEND:20170208T170000Z
UID:TALK2402AT
URL:/talk/index/2402
DESCRIPTION: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 tha
t form an arithmetic progression. An independent s
et in the hypergraph is a subset of the vertices t
hat contain no edge - in the example\, it would be
a set of integers containing no 3-AP. It has rece
ntly been discovered that the independent sets in
any hypergraph must be structured in some way: the
y are all contained within one of a small collecti
on of "independent-like" subsets. We shall discuss
this discovery and its applications.
LOCATION:Lecture room A\, Watson building
CONTACT:Simon Goodwin
END:VEVENT
END:VCALENDAR