## Containers in CombinatoricsAdd 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:Note that ex-directory lists are not shown. |
## Other listsEPS - College Research and KT Support Activities Facts and Snacks Analysis seminar## Other talksTowards Efficient and Robust Data-Driven Optimization The percolating cluster is invisible to image recognition with deep learning Signatures of structural criticality and universality in the cellular anatomy of the brain Non-Newtonian fluid injection into an otherwise Newtonian boundary layer [Seminar]: Two easy three-body problems [Friday seminar]: Irradiated brown dwarfs in the desert |