ACO The ACO Seminar (2015–2016)

Oct. 22, 3:30pm, Wean 8220
Asaf Ferber, Yale
Online Sprinkling and packing problems


In this talk I present a new perspective due to Vu 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 Vu), packing loose cycles (with Luh, Nguyen and Montealegre), packing arbitrarily oriented Ham cycles in directed graphs (with Long), and packing given spanning trees in G(n,p) (with Lee and Samotij).

Back to the ACO home page