|
Department of Mathematical Sciences
Events
People
Colloquia and Seminars
Conferences
Centers
Positions
Areas of Research
About the Department
Alumni |
Algorithms, Combinatorics and Optimization Seminar
Yale Title: Sprinkling and packing problems Abstract: 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). Date: Thursday, October 22, 2015 Time: 3:30 pm Location: Wean Hall 8220 |
