research
∙
05/08/2023
Isomorphisms between dense random graphs
We consider two variants of the induced subgraph isomorphism problem for...
share
research
∙
11/02/2022
The degree-restricted random process is far from uniform
The degree-restricted random process is a natural algorithmic model for ...
research
∙
01/03/2022
On the concentration of the chromatic number of random graphs
Shamir and Spencer proved in the 1980s that the chromatic number of the ...
research
∙
05/25/2021
The jump of the clique chromatic number of random graphs
The clique chromatic number of a graph is the smallest number of colors ...
research
∙
04/16/2021
On the power of random greedy algorithms
In this paper we solve two problems of Esperet, Kang and Thomasse as wel...
research
∙
11/18/2020
Prague dimension of random graphs
The Prague dimension of graphs was introduced by Nesetril, Pultr and Rod...
research
∙
09/20/2020
Note on Sunflowers
A sunflower with p petals consists of p sets whose pairwise intersection...
research
∙
09/06/2019
Bounds on Ramsey Games via Alterations
This note contains a refined alteration approach for constructing H-free...
research
∙
05/22/2019
On Wormald's differential equation method
This note contains a short and simple proof of Wormald's differential eq...
research
∙
11/16/2017
