Methods and Challenges in Extremal and Probabilistic Combinatorics
Videos from BIRS Workshop
Jacob Fox, Stanford University
Monday Aug 24, 2015 09:00 - 09:35
Packing problems
Alex Scott, University of Oxford
Monday Aug 24, 2015 10:43 - 11:15
Graphs of large chromatic number
Dhruv Mubayi, University of Illinois Chicago
Monday Aug 24, 2015 11:20 - 11:46
Hypergraph Ramsey numbers
Po-Shen Loh, Carnegie Mellon University
Monday Aug 24, 2015 14:21 - 14:52
Directed paths: from Ramsey to Ruzsa and Szemeredi
Tibor Szabó, Freie Universität Berlin
Monday Aug 24, 2015 15:43 - 16:16
Half-random Maker-Breaker games
Choongbum Lee, Massachusetts Institute of Technology
Monday Aug 24, 2015 17:00 - 17:29
Ramsey numbers of degenerate graphs
David Conlon, California Institute of Technology
Tuesday Aug 25, 2015 09:03 - 09:29
Rational exponents in extremal graph theory
Hao Huang, University of Minnesota, Twin Cities
Tuesday Aug 25, 2015 09:40 - 10:05
Digraphs of large girth with every small subset dominated
Alexandr Kostochka, University of Illinois at Urbana-Champaign
Tuesday Aug 25, 2015 10:43 - 11:08
On the Corradi-Hajnal Theorem and a question of Dirac
Shagnik Das, Freie Universitat Berlin
Tuesday Aug 25, 2015 11:21 - 11:43
A removal lemma for nearly-intersecting families
Asaf Shapira, Tel Aviv University
Tuesday Aug 25, 2015 12:00 - 12:21
Decomposing a graph into expanding subgraphs
Nati Linial, Hebrew University of Jerusalem
Wednesday Aug 26, 2015 09:01 - 09:34
Random simplicial complexes - Progress report
Hamed Hatami, McGill University
Wednesday Aug 26, 2015 09:41 - 10:11
On the boundary of the region defined by homomorphism densities
Boris Bukh, Carnegie Mellon University
Wednesday Aug 26, 2015 10:42 - 11:13
Ranks of matrices with few distinct entries
Mathias Schacht, University of Hamburg and Yale University
Wednesday Aug 26, 2015 11:20 - 11:50
Forcing quasirandomness with triangles
Noga Alon, Princeton University and Tel Aviv University
Wednesday Aug 26, 2015 13:41 - 14:11
Augmented trees with high girth
Jacques Verstraete, University of California at San Diego
Wednesday Aug 26, 2015 14:25 - 14:51
Full subgraphs
Jozsef Balogh, University of Illinois at Urbana-Champaign
Wednesday Aug 26, 2015 15:41 - 16:10
Triangle factors in graphs with small independence number
Deryk Osthus, Birmingham University
Wednesday Aug 26, 2015 16:19 - 16:49
Decompositions of large graphs into small subgraphs
Ehud Friedgut, Weizmann Institute
Thursday Aug 27, 2015 09:01 - 09:39
Entropy as a tool for proving analytical and geometrical inequalities
Daniela Kuhn, Birmingham University
Thursday Aug 27, 2015 09:43 - 10:11
Optimal path and cycle decompositions of random graphs
Van Vu, Yale University
Thursday Aug 27, 2015 10:42 - 11:16
Anti-concentration inequalities for polynomials
Sergey Norin, McGill University
Thursday Aug 27, 2015 11:20 - 11:50
The extremal function for 2-regular minors
Oleg Pikhurko, University of Warwick
Thursday Aug 27, 2015 12:01 - 12:33
Supersaturation problem for colour-critical graphs
