Sessions

Hamilton cycles in inhomogeneous random graphs

Simplicial Complexes – Combinatorial and Probabilistic Challenges

coffee break

The hitting time of a clique factor

Abstract

Blowup Ramsey numbers

Abstract

A Critical Probability for Biclique Partition Number of G(n,p)

Abstract

Minimum degree of asymmetric Ramsey-minimal graphs

Abstract

Hamilton completion and the path cover number of G(n,p)

Abstract

Ramsey goodness of bounded degree trees versus general graphs

Abstract

Partitioning 2-edge-coloured graphs into monochromatic cycles

Abstract

Approximate subgraph count in community affiliation network

Abstract

lunch

Semi-random process

Abstract

Sparse Hypergraph Blow-up Lemma

Abstract

Tangled Paths: a new random graph model from Mallows permutations

Abstract

Subgraphs of semirandom graphs

Abstract

Hypergraph removal with polynomial bounds

Abstract

Cycles in Mallows random permutations

Abstract

coffee break

Powers of Hamilton cycles in randomly augmented Dirac graphs

Abstract

On the chromatic number of graphons

Abstract

Percolation in the Product of Many Regular Graphs

Abstract

On graphs perturbed by a random geometric graph

Abstract

Common graphs with high chromatic number

Abstract

Expansion in the giant component of the percolated hypercube

Abstract

Schur properties of randomly perturbed sets

Abstract

Logarithmic convergence of projective planes

Abstract

1-Independent Percolation in Z^2 x K_n

Abstract

Distributions of Missing Sums in Sumsets

Abstract

Incest and infanticide: a branching process with deletions and mergers that matches the threshold for hypercube percolation

Abstract

A Modification of the Random Cutting Model

Abstract

Welcome Party

Topological aspects of random graphs

coffee break and conference photo

The upper tail problem for induced 4-cycles in sparse random graphs

Abstract

The number of n-queens configurations

Abstract

Simonovits’s Theorem in random graphs

Abstract

The n-queens problem

Abstract

Ramsey numbers of cycles in random graphs

Abstract

On Symmetric Intersecting Families

Abstract

The List-Ramsey Threshold

Abstract

Equiangular lines and regular graphs

Abstract

lunch

Equiangular lines and eigenvalue multiplicities

Abstract

coffee break

Transference for loose Hamilton cycles in random 3-uniform hypergraphs

Abstract

Degree conditions for spanning hypergraphs

Abstract

An asymtotically optimal threshold bias for some (a : b) Maker-Breaker games

Abstract

Long paths and cycles in random hypergraphs and related algorithms

Abstract

Cycle decompositions in k-uniform hypergraphs

Abstract

The (p:q)-Discrepancy Game in Hypergraphs

Abstract

Cohomology groups of non-uniform random simplicial complexes

Abstract

Conflict-free hypergraph matchings

Abstract

Multistage Maker-Breaker Game

Abstract

An improved lower bound on the length of the longest cycle in random graphs

Abstract

On a generalisation of Dirac’s Theorem to uniformly dense hypergraphs

Abstract

The Potential Function Approach for Maker-Breaker Games

Abstract

Large deviations in random graphs

coffee break

Sufficient conditions for perfect mixed tilings

Abstract

Patterns in Random Words

Abstract

Dirac-type results for tilings and coverings in ordered graphs

Abstract

Asymptotics of the overflow in urn models

Abstract

Counting spanning trees in Dirac graphs

Abstract

The full rank condition for sparse random matrices

Abstract

Oriented discrepancy of Hamilton cycles

Abstract

Functional Central Limit Theorems for Local Statistics of Spatial Birth-Death Processes in the Thermodynamic Regime

Abstract

lunch

Walking tour of Gniezno

Random Run

Asymptotic enumeration of graphs by degree sequence

Abstract

coffee break

New Ramsey Multiplicity Bounds and Search Heuristics

Abstract

CANCELLED

Abstract

Rainbow matchings in groups

Abstract

The threshold for stacked triangulations

Abstract

Size-Ramsey numbers of graphs with maximum degree three

Abstract

Markov chains and sampling methods for contiguous partitions

Abstract

The recent developments of dependency graphs

Abstract

Hamilton decompositions of regular bipartite tournaments

Abstract

lunch

Switching techniques for enumeration of graphs and generation of random graphs

Abstract

coffee

Perfect matchings and sandwich conjectures of random regular graphs

Abstract

Resolution of the Erdős-Sauer problem on regular subgraphs

Abstract

Phase Transitions in Geometric Random Graphs on 2-dim Torus: Critical Phase

Abstract

Degree Sequences of Random Uniform Hypergraphs

Abstract

Spanning trees in dense directed graphs

Abstract

Maximum degree in random planar graphs

Abstract

Mixing time of the switch chain on regular bipartite graphs

Abstract

Distinct degrees and homogeneous sets in graphs

Abstract

On n-saturated closed graphs, or randomness in the service of her majesty logic

Abstract

Banquet

Analysing random structures using the Warning Propagation algorithm

Abstract

Multicolor Turán numbers

Abstract

Hypergraphs with minimum positive uniform Turán density

Abstract

Symmetric Binary Perceptron Model: Algorithms and Barriers

Abstract

coffee

The Turán density of three-uniform tight cycles

Abstract

Graphs With Large Minimum Degree and No Small Odd Cycles Are Three Colourable

Abstract

The Turán number of the grid

Abstract

The 1-2-3 Conjecture – recent progresses

Abstract

The The Erdős-Gyárfás function $f(n, 4, 5) = \frac{5}{6}n + o(n)$ (so Gyárfás was right)

Abstract

Local Computation Algorithms for Coloring of Uniform Hypergraphs

Abstract

Erdős’s conjecture on pancyclicity of Hamiltonian graphs

Abstract

Defective colouring of hypergraphs

Abstract

lunch

Clique packings in random graphs

Abstract

Graph flip processes

Abstract

Anticoncentration via the strong perfect graph theorem

Abstract

There are at most O(m^0.31m) non-isomorphic combinatorial 3-spheres with m faces

Abstract

coffee

On two point concentration of the independence number of G_{n,p}

FAREWELL PARTY