8:009:00

light breakfast

9:1010:00

Andrew Thomason
Containers and list colourings

10:0010:30

coffee break

Sessions 4A, 4B, 4C


A  Rashid Auditorium

B  GatesHilman room 4307

C  GatesHilman room 4405

10:3010:55

Chaim Even Zohar
Random knots

Tim Garoni
The worm process for the Ising model is rapidly mixing

Louis DeBiasio
Arbitrarily oriented Hamilton cycles: an extension of Dirac's theorem to digraphs

11:0011:25

Ke Wang
Random weighted projections, random quadratic forms and random eigenvectors

Andrew Beveridge
A Hitting Time formula for the Discrete Green's Function

Richard Mycroft
Tight cycles and regular slices in dense hypergraphs

11:3011:55

Yen Do
Real roots of random polynomials

Antonio Blanca
Dynamics for the meanfield randomcluster model

Theodore Molla
Triangle factors in graphs with large minimum degree and no large independent sets

12:0012:25

Mihyun Kang
The Minimum Bisection in the Planted Bisection Model

Thomas Hayes
Codes, Lower Bounds and Phase Transitions in the Symmetric Rendezvous Problem

Matthew Kwan
Boundeddegree spanning trees in randomly perturbed graphs

12:302:00

lunch break

2:002:50

Jozsef Balogh
On some applications of the container method

3:003:20

coffee

Sessions 5A, 5B, 5C


A  Rashid Auditorium

B  GatesHilman room 4307

C  GatesHilman room 4405

3:203:45

Mindaugas Bloznelis
Modeling evolving affiliation networks via random intersection graph processes

Anshui Li
Treewidth of random geometric graphs

Will Perkins
Birthday Inequalities, Hard Spheres, and Independent Sets

3:504:15

Sang June Lee
CANCELLED On a phase transition of the random intersection graph: Supercritical region

Milan Bradonjic
Scaling Laws for Maximum Coloring of Sparse Random Geometric Graphs

Zilin Jiang
Topological Method for the Colored Bárány’s Theorem

4:204:45

Katarzyna Rybarczyk
Distributed MST algorithms and mindegree graph processes.

Zizhen Chen
Bipartite Subgraphs of Random Geometric Graphs

Nor Jaafari
Random graph colorings

4:455:00

fresh air break

Sessions 6A, 6B, 6C


A  Rashid Auditorium

B  GatesHilman room 4307

C  GatesHilman room 4405

5:005:25

Joel Spencer
The First Order World of GaltonWatson Trees  Preliminary Report

Charles Burnette
Representing Random Permutations as a Product of Two Involutions

Abram N Magner
Combinatorics of a Sequence to SelfAvoiding Walk Channel

5:305:55

Aleksandr Matushkin
Universal ZeroOne kLaw

Pawel Hitczenko
Random trees obtained from permutation graphs

Jan Volec
Properly colored and rainbow copies of graphs with few cherries

6:006:25

Maksim Zhukovskii
On infinite spectra of firstorder properties

Anant Godbole
A Variety of Threshold Progressions Related to Coverings and Packings

Alexey Pokrovskiy
Rainbow matchings and rainbow connectedness
