RANDOM STRUCTURES AND ALGORITHMS
Gniezno, 711 August, 20179:00 
Tibor Szabo When playing randomly is optimal 

10:0010:30  coffee break and conference photo  
Sessions 3A, 3B, 3C  
A  B  C  
10:3010:55 
Simi Haber Shattering random graphs 
Jakub Przybyło Neighbour set distinguishing edge colourings from lists of asymptotically optimal size 
Viresh Patel Decomposing tournaments into paths 
11:0011:25 
Oliver Cooley Core forging in random graphs 
Michelle Delcourt On the List Coloring Version of Reed's Conjectur 
Taisa Martins Finitely forcible graph limits are universal 
11:3011:55 
Gregory Sorkin Cuts in Random Cubic Graphs 
Jarosław Grytczuk From 123 conjecture to Riemann Hypothesis 
Vytautas Gruslys Tilings of product spaces 
12:0012:25 
John Sylvester Uniqueness of vertices with minimal $r$neighbourhoods in a random graph 
Margarita Akhmejanova Colorings of $b$simple hypergraphs 
Ben Barber Isoperimetry in integer lattices 
13:00  lunch  
14:30 
Rob Morris Colouring random graphs 

15:3016:00  coffee break 
Sessions 4A, 4B, 4C, 4D  
A  B  C  D  
16:0016:25 
Gal Kronenberg 2universality of random graphs 
Andrew Treglown The complexity of perfect matchings and packings in dense hypergraphs 
Lenar Iskhakov Local clustering coefficient in spatial preferential attachment model 
Matthew Coulson Rainbow Matchings in Dirac Graphs 
16:3016:55 
Rajko Nenadov Spanning universality in random graphs 
Pascal Su Finding Perfect Matchings in Random Graphs in Linear Time 
Xavier Pérez Giménez Perfect matchings and Hamiltonian cycles in the preferential attachment model 
Patrick Bennett Square of a Hamilton cycle in a random graph 
17:0017:25 
Matthew Kwan Random Designs 
Jaehoon Kim A characterization of testable hypergraph properties 
Tony Johansson Deletion of oldest edges in a preferential attachment graph 
Tassio Naia Unavoidable Trees in Tournaments 
sessions 7A, 7B, 7C  
A  B  C  
16:0016:25 
Chaim EvenZohar Patterns in Random Permutations 
Pawel Hitczenko Recurrences for generating polynomials 
Tuan Tran The structure of large sumfree sets of integers 
16:3016:55 
Eugenijus Manstavicius Random permutations with cycle weights 
Amanda Lohss The Statistical Structure of Concave Compositions 

16:5517:10  short break  
17:1017:40 
Lutz Warnke The phase transition in the random dprocess 

17:4018:10 
Nick Wormald Asymptotic enumeration of Latin rectangles via random graphs 

19:3023:00  Banquet 