A Note on the Erdős-Szekeres Theorem in Two Dimensions. - Lyuben Lichev (Electron. J. Comb., 2021)

On the chromatic number of the preferential attachment graph. - Lyuben Lichev (Eur. J. Comb., 2021)

Dynamic random graphs with vertex removal. - Josep Díaz; Lyuben Lichev; Bas Lodewijks (CoRR, 2022)

Lower bound on the running time of Pop-Stack Sorting on a random permutation. - Lyuben Lichev (CoRR, 2022)

New Constructions Related to the Polynomial Sphere Recognition Problem. - Johannes Carmesin; Lyuben Lichev (Discret. Comput. Geom., 2022)

Local boxicity. - Louis Esperet; Lyuben Lichev (Eur. J. Comb., 2022)

The giant component after percolation of product graphs. - Lyuben Lichev (J. Graph Theory, 2022)

On the modularity of 3-regular random graphs and random graphs with given degree sequences. - Lyuben Lichev; Dieter Mitsche (Random Struct. Algorithms, 2022)

On the Power of Choice for Boolean Functions. - Nicolas Fraiman; Lyuben Lichev; Dieter Mitsche (SIAM J. Discret. Math., 2022)

Conflict-free hypergraph matchings. - Stefan Glock; Felix Joos; Jaehoon Kim; Marcus Kühn; Lyuben Lichev (SODA, 2023)

On the Minimum Bisection of Random 3-Regular Graphs. - Lyuben Lichev; Dieter Mitsche (Electron. J. Comb., 2023)

Label propagation on binomial random graphs. - Marcos Kiwi; Lyuben Lichev; Dieter Mitsche; Pawel Pralat (CoRR, 2023)

Localization game for random geometric graphs. - Lyuben Lichev; Dieter Mitsche; Pawel Pralat (Eur. J. Comb., 2023)

On the boxicity of Kneser graphs and complements of line graphs. - Marco Caoduro; Lyuben Lichev (Discret. Math., 2023)

The jump of the clique chromatic number of random graphs. - Lyuben Lichev; Dieter Mitsche; Lutz Warnke (Random Struct. Algorithms, 2023)

Large monochromatic components in colorings of complete hypergraphs. - Lyuben Lichev; Sammy Luo (J. Comb. Theory, Ser. A, 2024)

Percolation on dense random graphs with given degrees. - Lyuben Lichev; Dieter Mitsche; Guillem Perarnau (J. Comb. Theory B, 2024)

Sharp threshold for embedding balanced spanning trees in random geometric graphs. - Alberto Espuny Díaz; Lyuben Lichev; Dieter Mitsche; Alexandra Wesolek (J. Graph Theory, 2024)

The Maximal Running Time of Hypergraph Bootstrap Percolation. - Ivailo Hartarsky; Lyuben Lichev (SIAM J. Discret. Math., 2024)

Color-avoiding percolation of random graphs: Between the subcritical and the intermediate regime. - Lyuben Lichev (Discret. Math., 2024)

Annulus Graphs in ℝd. - Lyuben Lichev; Tsvetomir Mihaylov (Discret. Comput. Geom., 2024)

The semi-random tree process. - Sofiya Burova; Lyuben Lichev (Eur. J. Comb., 2025)

$d$ -connectivity of the random graph with restricted budget. - Lyuben Lichev (J. Graph Theory, 2025)