Triangles in tripartite graphs
|
Tue, 16/11/2010 14:30 |
John Talbot (UCL) |
Combinatorial Theory Seminar  |
L3 |
| 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? | |||