Zoom Link: 
https://huji.zoom.us/j/84511564169?pwd=SkJmY285YnFIWkZqNmxuaVZsVVQ2UT09

Meeting ID: 845 1156 4169

Passcode:    171220

Title: Monochromatic triangles in Kneser Graphs


Abstract: We study the problem of 2-colouring the vertices of kneser graphs in a way that minimises the number of monochromatic triangles, given some "balance" conditions on the distribution of the colours. The critical cases are when the subsets of the ground set have size close to one third. These problems arise from the theory of election rules and we also answer a more general problem in which a third colour representing a "tie" is allowed.