[Combprob] Thursday, 10/1: Asaf Ferber (Yale) "Online Sprinkling and packing problems"

[Daniel Spielman]

LOM 215 at 4:00.

Abstract:
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).

For more information, see:
https://urldefense.proofpoint.com/v2/url?u=https-3A__sites.google.com_a_yale.edu_combprob_home&d=AwIBaQ&c=-dg2m7zWuuDZ0MUcV7Sdqw&r=LF0MQT9lkPQlp3gHlW9D2fTc0d4apDhCuC758tavUvQ&m=eZFw0IEcwiMDWUW84aC7upR3ndhyxyXNaWaTiNLQ3Jo&s=cZC9dquitnUYQCEep42LtjmyMQ4HB8yqtFt4_FNTPXc&e= 
-------------- next part --------------
An HTML attachment was scrubbed...
URL: http://mailman.yale.edu/pipermail/combprob/attachments/20150928/8085d40c/attachment.html