Event time:
Thursday, October 1, 2015 - 12:00pm to 1:00pm
Location:
215 LOM
Speaker:
Asaf Ferber
Speaker affiliation:
Yale
Event description:
In this talk I present a new perspective due to Van and myself of generating random structures, referred to as online sprinkling. Using this method, with several coauthors we solve few packing problems in random graphs and hypergraphs for almost optimal probabilities, such as:
Packing perfect matchings in hypergraphs (with Van), packing loose cycles (with Luh, Nguyen and Montealegre), packing arbitrarily oriented Ham cycles in directed graphs (with Long), and packing given spanning trees in Gnp (with Lee and Samotij).