Seminar series
Date
Tue, 30 Apr 2019
Time
14:30 -
15:30
Location
L6
Speaker
Jozef Skokan
Further Information
Given positive integers n,r,k, the Erdős-Rothschild problem asks to determine the largest number of r-edge-colourings without monochromatic k-cliques a graph on n vertices can have. In the case of triangles, i.e. when k=3, the solution is known for r = 2,3,4. We investigate the problem for five and six colours.