Lyuben Lichev

Publication Activity (10 Years)

Years Active: 2021-2024
Publications (10 Years): 23

Top Topics

Preferential Attachment

Top Venues

Discret. Comput. Geom.

Electron. J. Comb.

Publications

Ivailo Hartarsky, Lyuben Lichev
The Maximal Running Time of Hypergraph Bootstrap Percolation. SIAM J. Discret. Math. 38 (2) (2024)
Lyuben Lichev, Dieter Mitsche, Guillem Perarnau
Percolation on dense random graphs with given degrees. J. Comb. Theory B 167 (2024)
Lyuben Lichev
Color-avoiding percolation of random graphs: Between the subcritical and the intermediate regime. Discret. Math. 347 (1) (2024)
Lyuben Lichev, Tsvetomir Mihaylov
. Discret. Comput. Geom. 72 (1) (2024)
Lyuben Lichev, Sammy Luo
Large monochromatic components in colorings of complete hypergraphs. J. Comb. Theory, Ser. A 205 (2024)
Marco Caoduro, Lyuben Lichev
On the boxicity of Kneser graphs and complements of line graphs. Discret. Math. 346 (5) (2023)
Lyuben Lichev, Dieter Mitsche, Lutz Warnke
The jump of the clique chromatic number of random graphs. Random Struct. Algorithms 62 (4) (2023)
Lyuben Lichev, Dieter Mitsche
On the Minimum Bisection of Random 3-Regular Graphs. Electron. J. Comb. 30 (2) (2023)
Marcos Kiwi, Lyuben Lichev, Dieter Mitsche, Pawel Pralat
Label propagation on binomial random graphs. CoRR (2023)
Alberto Espuny Díaz, Lyuben Lichev, Dieter Mitsche, Alexandra Wesolek
Sharp threshold for embedding balanced spanning trees in random geometric graphs. CoRR (2023)
Lyuben Lichev, Dieter Mitsche, Pawel Pralat
Localization game for random geometric graphs. Eur. J. Comb. 108 (2023)
Stefan Glock, Felix Joos, Jaehoon Kim, Marcus Kühn, Lyuben Lichev
Conflict-free hypergraph matchings. SODA (2023)
Louis Esperet, Lyuben Lichev
Local boxicity. Eur. J. Comb. 102 (2022)
Lyuben Lichev
Lower bound on the running time of Pop-Stack Sorting on a random permutation. CoRR (2022)
Lyuben Lichev, Dieter Mitsche
On the modularity of 3-regular random graphs and random graphs with given degree sequences. Random Struct. Algorithms 61 (4) (2022)
Lyuben Lichev
The giant component after percolation of product graphs. J. Graph Theory 99 (4) (2022)
Nicolas Fraiman, Lyuben Lichev, Dieter Mitsche
On the Power of Choice for Boolean Functions. SIAM J. Discret. Math. 36 (3) (2022)
Josep Díaz, Lyuben Lichev, Bas Lodewijks
Dynamic random graphs with vertex removal. CoRR (2022)
Johannes Carmesin, Lyuben Lichev
New Constructions Related to the Polynomial Sphere Recognition Problem. Discret. Comput. Geom. 67 (4) (2022)
Lyuben Lichev
On the chromatic number of the preferential attachment graph. Eur. J. Comb. 96 (2021)
Lyuben Lichev, Dieter Mitsche, Lutz Warnke
The jump of the clique chromatic number of random graphs. CoRR (2021)
Lyuben Lichev
A Note on the Erdős-Szekeres Theorem in Two Dimensions. Electron. J. Comb. 28 (2) (2021)
Nicolas Fraiman, Lyuben Lichev, Dieter Mitsche
On the power of choice for Boolean functions. CoRR (2021)