Seminar series
Date
Tue, 16 Nov 2010
Time
14:30 -
15:30
Location
L3
Speaker
John Talbot
Organisation
UCL
How many triangles must a graph of density d contain? This old question due to Erdos was recently answered by Razborov, after many decades of progress by numerous authors.
We will consider the analogous question for tripartite graphs. Given a tripartite graph with prescribed edges densities between each
pair of classes how many triangles must it contain?