Thursday
9:00 - 10:00
Asymptotic enumeration of graphs by degree sequence
10:00 - 10:30
coffee break
Session 7A
Session 7B
New Ramsey Multiplicity Bounds and Search Heuristics
Rainbow matchings in groups
Size-Ramsey numbers of graphs with maximum degree three
Hamilton decompositions of regular bipartite tournaments
CANCELLED
The threshold for stacked triangulations
Markov chains and sampling methods for contiguous partitions
13:00
lunch
15:00 - 16:00
Switching techniques for enumeration of graphs and generation of random graphs
16:00 - 16:30
coffee
Session 8A
Session 8B
Session 8C
Degree Sequences of Random Uniform Hypergraphs
Mixing time of the switch chain on regular bipartite graphs
Resolution of the Erdős-Sauer problem on regular subgraphs
Spanning trees in dense directed graphs
Distinct degrees and homogeneous sets in graphs
Phase Transitions in Geometric Random Graphs on 2-dim Torus: Critical Phase
Maximum degree in random planar graphs
On n-saturated closed graphs, or randomness in the service of her majesty logic
19:00 - 23:00
Banquet