University of Cambridge > Talks.cam > Combinatorics Seminar > List colourings and preference orders

  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

List colourings and preference orders

Download to your calendar using vCal

  • UserAndrew Thomason (University of Cambridge)
  • ClockThursday 04 May 2017, 14:30-15:30
  • HouseMR12.

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

The list chromatic number of a hypergraph G is the smallest number k such that, for any assignment to each vertex of G of a list of k colours, it is possible for each vertex to choose a colour from its list so that no edge is monochromatic. Alon showed that the list chromatic number of a graph is of order at least log d, where d is the average degree. Saxton et at did the same for r-uniform hypergraphs, using the container method.

Is the lower bound best possible? Using a notion of “preference orders” we examine the list chromatic numbers of multipartite hypergraphs, showing thereby that the lower bound is best possible for r=2 and r=3 but probably not for r>=4. This is joint work with Arès Méroueh.

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

Pfizer Lecture Theatre, Department of Chemistry, Lensfield Road Museum of Archaeology and Anthropology, Downing Street, City Centre, Cambridge, CB2 3DZ Main Lecture Theatre, Divinity School, St John's College, Cambridge

Other talks

Advances in Label-Free High-Resolution Molecular Imaging using J Series III Cluster SIMS Talk TBC Differences between Robin and Neumann eigenvalues Task performance predicts the substitution of feedforward by feedback drive in visual cortex Chemical strategies for biomolecule functionalisation, and biomaterial conjugation Dr Dinis Calado, Senior Group Leader, Immunity and Cancer Laboratory, the Francis Crick Institute
 

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