RS&A2017

The 18th International Conference on

RANDOM STRUCTURES AND ALGORITHMS

Gniezno, 7-11 August, 2017

Program - updated: 2017-08-09 00:30

Download PDF version (2017-08-09 00:30)

MONDAY

9:00	Laszlo Babai Permutation groups and Graph Isomorphism
10:00-10:30	coffee break
10:30	Laszlo Babai Coherent configurations and Graph Isomorphism
11:30-11:45	short break
Sessions 1A, 1B, 1C
	A	B	C
11:45-12:10	Anita Liebenau The degree sequence of the random graph & asymptotic enumeration of regular graphs	Huseyin Acan Disproof of a conjecture of Alon and Spencer	Peleg Michaeli On the trace of random walks on random graphs
12:15-12:40	Matas Sileikis Embedding the Erd\H{o}s-R\'enyi graph into the random regular graph	Eoin Long Forbidden vector-valued intersections	Malvina Vamvakari On First Passage Times of $q$-Random Walks
13:00	lunch
Sessions 1A, 1B, 1C (continued)
	A	B	C
14:30-14:55	Fiona Skerman Modularity of Networks	Shagnik Das Families of Mass Destruction	Michał Morayne Tail probabilities of a random walk on an interval
15:00-15:25	Liudmila Ostroumova Prokhorenkova Modularity in several random graph models	Christopher Kusch Shattering extremal set systems from Sperner families.	Małgorzata Kuchta Maximizing survival time in a random walk on an interval
15:30-16:00	coffee break

Sessions 2A, 2B, 2C, 2D
	A	B	C	D
16:00-16:25	Clara Shikhelman Many T copies in H-free subgraphs of random graphs	Pedro Vieira Eventowns for multiple intersections	Kevin Leckey The asymptotic compression rate of Lempel-Ziv on Markov sources	Sylwia Antoniuk When a random triangular group is free
16:30-16:55	Andrzej Dudek Multicolor Ramsey Properties of Random Graphs and Hypergraphs	Tamás Mészáros Boolean dimension and tree-with	Charilaos Efthymiou Improved bounds for sampling colorings of random graphs	Chris Dowden The evolution of random graphs on surfaces
17:00-17:25	Matija Bucic Directed Ramsey number for Trees	Adam Zsolt Wagner Families with few chains	Peter Ayre Freezing in Hypergraph Colouring	Michael Mosshammer Phase transitions of random graphs on a surface
17:25-17:40	short break
17:40-18:05	Dudley Stark The probability of nonexistence of a subgraph in a moderately sparse random graph	Przemysław Gordinowicz How to generate the random poset?	Andrew McDowell Dispersion Processes	Maciej Dołęga Random quadrangulations of general surfaces
18:10-18:40	Maksim Zhukovskii On the median number of P_3 in G(n,p)	David Penman Comparable pairs and linear extensions	Nina Kamcev Zero forcing number of random and pseudorandom graphs	Demetres Christofides Asymptotic complexity of matrix reduction over finite fields
19:00	Welcome Party

TUESDAY

9:00	Tibor Szabo When playing randomly is optimal
10:00-10:30	coffee break and conference photo
Sessions 3A, 3B, 3C
	A	B	C
10:30-10: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:00-11: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:30-11:55	Gregory Sorkin Cuts in Random Cubic Graphs	Jarosław Grytczuk From 1-2-3 conjecture to Riemann Hypothesis	Vytautas Gruslys Tilings of product spaces
12:00-12: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:30-16:00	coffee break

Sessions 4A, 4B, 4C, 4D
	A	B	C	D
16:00-16:25	Gal Kronenberg 2-universality 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:30-16: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:00-17: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

WEDNESDAY

9:00	Dan Kral Graph limits and extremal combinatorics
10:00-10:30	coffee break
Sessions 5A, 5B, 5C
	A	B	C	D
10:30-10:55	Carlos Hoppen Properly coloured spanning trees in an edge coloured random graph	Robert Hancock Independent sets in hypergraphs and Ramsey properties of graphs and the integers	Xing Shi Cai Large fringe and non-fringe subtrees in conditional Galton-Watson trees	Nemanja Skoric Resilience of almost-perfect H-packing
11:00-11:25	Dániel Korándi Monochromatic cycle cover in random graphs	Igor Balla Ramsey goodness of bounded degree trees	Henning Sulzbach Asymptotic expansions for the profile of random trees	Milos Trujic Local resilience of an almost spanning k-cycle in sparse random graphs
11:30-11:55	Deepak Bal Monochromatic Components in Random Graphs	Istvan Tomon Ramsey Graphs Induce Subgraphs of Many Different Sizes	Michał Przykucki Parking on a random tree	Frank Mousset Resilience for cycle covers in sparse random graphs
12:00-12:25	Shoham Letzter Long monochromatic paths in 2-coloured random tournaments	He Guo Packing nearly optimal R(3,t) graphs	Katarzyna Rybarczyk Hamilton cylcles in random intersection graphs	Alexander Gnedin Infinite random orders and permutations
12:30-12:55	Stefan Glock Designs beyond quasirandomness	Omri Ben-Eliezer Ordered graph removal lemma	Christoph Koch Localised infections in geometric inhomogeneous random graphs	Jan Volec On large multipartite subgraphs of H-free graphs
13:00	lunch
14:30-16:30	excursion
18:00-19:00	Random Run

THURSDAY

9:00	David Conlon How to build a hypergraph expander
10:00-10:30	coffee break
Sessions 6A, 6B, 6C, 6D
	A	B	C	D
10:30-10:55	Pu (Jane) Gao On Aharoni-Berger's conjecture of rainbow matchings	Andrzej Grzesik Minimum number of edges that occur in odd cycles	Tamas Makai Bootstrap percolation on random k-uniform hypergraphs	Pawel Pralat Clique colouring of binomial random graphs and random geometric graphs
11:00-11:25	Olaf Parczyk Finding tight Hamilton cycles in random hypergraphs faster	Florian Pfender On induced 5-cycles	Nikolaos Fountoulakis On percolation on random graphs with given degrees	Sergei Kiselev On the chromatic numbers of random subgraphs of Kneser graphs
11:30-11:55	Richard Mycroft Hamilton $\ell$-cycles in randomly perturbed hypergraphs.	Mykhaylo Tyomkyn On the inducibility of cycles	Jonathan Noel Bootstrap percolation in a random subhypergraph	Joel Larsson Biased random k-SAT
12:00-12:25	Yury Person Embedding spanning bounded degree subgraphs in randomly perturbed graphs	Victor Falgas-Ravry Full and co-full subgraphs of a graph	Frederik Garbe Contagious Sets in Degree-Proportional Bootstrap Percolation	Halina Bielak Turan and Ramsey numbers for selected semi-topological graphs
13:00	lunch
14:30	Benny Sudakov Rainbow cycles and trees in properly edge-colored complete graphs
15:30-16:00	coffee

sessions 7A, 7B, 7C
	A	B	C
16:00-16:25	Chaim Even-Zohar Patterns in Random Permutations	Pawel Hitczenko Recurrences for generating polynomials	Tuan Tran The structure of large sum-free sets of integers
16:30-16:55	Eugenijus Manstavicius Random permutations with cycle weights	Amanda Lohss The Statistical Structure of Concave Compositions
16:55-17:10	short break
17:10-17:40	Lutz Warnke The phase transition in the random d-process
17:40-18:10	Nick Wormald Asymptotic enumeration of Latin rectangles via random graphs
19:30-23:00	Banquet

FRIDAY

9:00	Penny Haxell Chromatic index of random multigraphs
10:00-10:30	coffee break
Sessions 8A, 8B, 8C
	A	B	C
10:30-10:55	Rafał Witkowski Multicoloring of random hexagonal graphs	Joanna Polcyn Multicolor Ramsey number for the loose 3-path of length three	David Ramsey On Variants of the Best Choice Problem with Different Classes of Objects
11:00-11:25	Alexander Semenov On the j-chromatic number of a random hypergraph	Jan Corsten Grid Ramsey problem	Matjaz Krnc Simple and fast consensus in networks
11:30-11:55	Dmitrii Shabanov Estimating r-colorability threshold in a random hypergraph: a simple approach to the second moment method	Alexey Pokrovskiy Fast draws in strong games	Aleksandr Matushkin On limit points of spectra of first order graph properties with small quantifier depth
12:00-12:25	Annika Heckel The chromatic number of dense random graphs	Adva Mond Positional Games on vertex sets of Random Graphs	Tobias Mueller The Logic of Random Perfect Graphs
13:00	lunch
14:30	Jacob Fox Arithmetic progressions, regularity, removal, and quasirandomness
15:30-16:00	coffee break
16:00-16:30	Svante Janson Vertex exchangeable and edge exchangeable random graphs
16:35-17:05	Alan Frieze Minors of a random binary matroid