Lyuben Lichev

collaborators

3 papers

math.OC2024

Zero-sum Random Games on Directed Graphs

Luc Attia, Lyuben Lichev, Dieter Mitsche +2

This paper considers a class of two-player zero-sum games on directed graphs whose vertices are equipped with random payoffs of bounded support known by both players. Starting from…

math.CO2023

Sharp threshold for embedding balanced spanning trees in random geometric graphs

Alberto Espuny Díaz, Lyuben Lichev, Dieter Mitsche +1

A rooted tree is balanced if the degree of a vertex depends only on its distance to the root. In this paper we determine the sharp threshold for the appearance of a large family of…

math.PR2023

Color-avoiding percolation of random graphs: between the subcritical and the intermediate regime

Lyuben Lichev

Fix a graph $G$ in which every edge is colored in some of $k \geq 2$ colors. Two vertices $u$ and $v$ are CA-connected if $u$ and $v$ may be connected using any subset of $k - 1$ col…