Monday
Simplicial Complexes – Combinatorial and Probabilistic Challenges
10:00 - 10:30
coffee break
Session 1A
Session 1B
The hitting time of a clique factor
A Critical Probability for Biclique Partition Number of G(n,p)
Hamilton completion and the path cover number of G(n,p)
Approximate subgraph count in community affiliation network
Blowup Ramsey numbers
Minimum degree of asymmetric Ramsey-minimal graphs
Partitioning 2-edge-coloured graphs into monochromatic cycles
13:00
lunch
Session 2A
Session 2B
Session 2C
Semi-random process
Subgraphs of semirandom graphs
Sparse Hypergraph Blow-up Lemma
Hypergraph removal with polynomial bounds
Tangled Paths: a new random graph model from Mallows permutations
Cycles in Mallows random permutations
16:00 - 16:30
coffee break
Session 3A
Session 3B
Session 3C
Powers of Hamilton cycles in randomly augmented Dirac graphs
On graphs perturbed by a random geometric graph
Schur properties of randomly perturbed sets
Distributions of Missing Sums in Sumsets
On the chromatic number of graphons
Common graphs with high chromatic number
Logarithmic convergence of projective planes
A Modification of the Random Cutting Model
Percolation in the Product of Many Regular Graphs
Expansion in the giant component of the percolated hypercube
1-Independent Percolation in Z^2 x K_n
Incest and infanticide: a branching process with deletions and mergers that matches the threshold for hypercube percolation
19:00
Welcome Party