Combinatorics and Probability Seminar: Almost all Steiner triple systems are almost resolvable, by Asaf Ferber
April 12, 2021
3:00 PM - 3:50 PM
Asaf Ferber (UC Irvine): Almost all Steiner triple systems are almost resolvable
An order-n Steiner triple system is a collection of triples on
n elements with the property that every pair of elements is contained in
exactly one triple. We show that for any n divisible by 3, almost all
order-n Steiner triple systems admit a decomposition of almost all their
triples into disjoint perfect matchings (that is, almost all Steiner
triple systems are almost resolvable).
Joint work with Matthew Kwan.
Please click here to make changes to, or delete, this seminar announcement.
Date posted
Apr 21, 2021
Date updated
Apr 21, 2021
Speakers
