January 21, 2008
Mixing in Oriented Graphs
Omid Amini
Max Planck Institut für Informatik
I will give an account of the new notion of pseudo-randomness for orientations of graphs, that we have called mixing, and its consequences in the extremal theory of digraphs.

Joint work with Florian Huc (INRIA Sophia-Antipolis) and Simon Griffiths (Cambridge University).