4 citations · 21 across the 45 of their papers we have counts for
7 papers · 1 filter
Annulus graphs in
Lyuben Lichev, Tsvetomir Mihaylov
A -dimensional annulus graph with radii and (here ) is a graph embeddable in so that two vertices and form an edge if and only…
On the power of choice for Boolean functions
Nicolas Fraiman, Lyuben Lichev, Dieter Mitsche
In this paper we consider a variant of the well-known Achlioptas process for graphs adapted to monotone Boolean functions. Fix a number of choices and a sequence o…
New results for the random nearest neighbor tree
Lyuben Lichev, Dieter Mitsche
In this paper, we study the online nearest neighbor random tree in dimension (called -NN tree for short) defined as follows. We fix the torus of…
The jump of the clique chromatic number of random graphs
Lyuben Lichev, Dieter Mitsche, Lutz Warnke
The clique chromatic number of a graph is the smallest number of colors in a vertex coloring so that no maximal clique is monochromatic. In 2016 McDiarmid, Mitsche and Pralat noted…
On the Boxicity of Kneser Graphs and Complements of Line Graphs
Marco Caoduro, Lyuben Lichev
An axis-parallel -dimensional box is a cartesian product where is a closed sub-interval of the real line. For a graph , t…
The giant component after percolation of product graphs
Lyuben Lichev
In this paper we show the existence of a sharp threshold for the appearance of a giant component after percolation of Cartesian products of graphs under assumptions on their maximu…
Localization Game for Random Geometric Graphs
Lyuben Lichev, Dieter Mitsche, Pawel Pralat
The localization game is a two player combinatorial game played on a graph . The cops choose a set of vertices with . The robber then chooses a…