COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring. |

## List colourings and preference ordersAdd to your list(s) Download to your calendar using vCal - Andrew Thomason (University of Cambridge)
- Thursday 04 May 2017, 14:30-15:30
- MR12.
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:- 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. |
## Other listsPhilosophy of Education Society of Great Britain: Cambridge Branch Cambridge Next Generation Sequencing Bioinformatics Day Cambridge University Entrepreneurs (CUE)## Other talksCurve fitting, errors and analysis of binding data Paediatric malignancies: an overview Atmospheric Structure Revealed by Refraction of Routine Radio Transmissions from Civil Aircraft. Lua: designing a language to be embeddable Random Feature Expansions for Deep Gaussian Processes |