Seminar series
Date
Tue, 01 Dec 2015
14:30
14:30
Location
L6
Speaker
Imre Leader
Organisation
University of Cambridge
It is easy to see that if a tournament (a complete oriented graph) has a directed cycle then it has a directed 3-cycle. We investigate the analogous question for 3-tournaments, and more generally for oriented 3-graphs.