Hypergraph containers and list colourings

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

• David Saxton (University of Cambridge)
• Thursday 20 October 2011, 14:30-15:30
• MR12.

If you have a question about this talk, please contact Andrew Thomason.

A container set for a hypergraph is a collection of subsets of the vertex set such that each independent set is a subset of a member of the collection. It is useful to have a small collection of bounded size containers, and we describe ways to acquire one. Lower bounds can thereby be established on the list chromatic number of the hypergraph, and we mention further applications.

This talk is part of the Combinatorics Seminar series.

This talk is included in these lists:

• All CMS events
• All Talks (aka the CURE list)
• CMS Events
• Combinatorics Seminar
• DPMMS Lists
• DPMMS Pure Maths Seminar
• DPMMS info aggregator
• DPMMS lists
• Hanchen DaDaDash
• Interested Talks
• MR12
• School of Physical Sciences
• bld31

Note that ex-directory lists are not shown.