When: Sunday, November 22, 10am
Where: Schreiber 309
Speaker: Roman Glebov, Hebrew University
Title: On the number of 1-factorizations
Recent results by Peter Keevash on the existence and number of
designs can be seen in more general terms as an approach to find and
count highly regular structures in combinatorics. One particular
instance of such structures is a 1-factorization of the complete
graph - a decomposition of its edge set into perfect matchings.
We use his machinery to obtain an estimation on the number of
1-factorizations, and discuss further directions.
Joint work in progress with Zur Luria.