On Thursday, 21.06.2018, at 16:15 in Arnimallee 3, SR 119
Benny Sudakov (ETH Zurich)
will give a talk on
Rainbow structures, Latin squares & graph decompositions
A subgraph of an edge-coloured graph is called rainbow if all its edges have distinct colours. The study of rainbow subgraphs goes back to the work of Euler on Latin squares. Since then rainbow structures were the focus of extensive research and found applications in design theory and graph decompositions. In this talk we discuss how probabilistic reasoning can be used to attack several old problems in this area. In particular we show that well known conjectures of Ryser, Hahn, Ringel, Graham-Sloane and Brualdi-Hollingsworth hold asymptotically.
Based on joint works with Alon, Montgomery, and Pokrovskiy.
To subscribe to the mailing-list of the seminar, please follow this link:
To add the .ics file of the calendar to your favorite calendar reader (that supports the ICal format), please follow this link:
To add the calendar feeds to your favorite feed reader, please follow this link:
For any request, please send an e-mail to: