University of Birmingham > Talks@bham > Combinatorics and Probability Seminar > The Erdős-Rothschild problem

The Erdős-Rothschild problem

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

If you have a question about this talk, please contact Johannes Carmesin.

Consider an $n$-vertex graph $G$ whose edges are coloured with $s$ colours so that there is no monochromatic clique of size $k$, and call such a colouring of $G$ valid. The Erdős-Rothschild problem from 1974 is to determine the maximum number of valid colourings over all $n$-vertex graphs $G$. This problem is in general wide open and an exact (or even asymptotic) answer is only known for a few pairs $(k,s)$. In this talk I will discuss a method for obtaining new exact results. Joint work with Oleg Pikhurko

This talk is part of the Combinatorics and Probability Seminar series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


Talks@bham, University of Birmingham. Contact Us | Help and Documentation | Privacy and Publicity.
talks@bham is based on from the University of Cambridge.