University of Cambridge > Talks.cam > Combinatorics Seminar > Hypergraph containers and list colourings

  Browse A-Z

Log in

Googledetails Microsoftdetails

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹ️ Information

Hypergraph containers and list colourings

Download to your calendar using vCal

  • UserDavid Saxton (University of Cambridge)
  • ClockThursday 20 October 2011, 14:30-15:30
  • HouseMR12.

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:

Note that ex-directory lists are not shown.

Other lists

Seminar Room (basement), Institute of Criminology, Sidgwick Avenue Mills & Reeve, Botanic House, 98-100 Hills Rd, Cambridge CB2 1PH ARCSOC Conversations

Other talks

Machine Learning for Spectral Geometry and Vice Versa  Life, death, and the discovery of PDAR: the Pol II Degradation-dependent Apoptotic Response  Title to be confirmed Title to be confirmed Feedback and the circumgalactic medium Title to be confirmed
 

© 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity