LLLyuben Lichev
Lyuben Lichev
*This is an algorithmically generated author record based on publicly available information.
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Lyuben Lichev has a total of 13 co-authors. Here are the top co-authors by number of shared publications:
- Adva Mond
Department of Mathematics, King’s College London, Strand, London, United Kingdom
1 shared publication - Amitai Linker
Univ. Andrés Bello
1 shared publication - Bas Lodewijks1 shared publication
- Dieter Mitsche
Institut Camille Jordan Univ. Jean Monnet Univ. de Lyon and IMC Pontifícia Univ. Católica de Chile
1 shared publication - Ivailo Hartarsky
INSA Lyon, Université Jean Monnet, ICJ
1 shared publication - Joshua Erde
Institute of Discrete Mathematics Graz University of Technology Graz Austria
1 shared publication
Latest Publications
- Open Access
- 27 April 2026
- Published by Springer Nature in Combinatorica
- Vol. 46 (3) , 17
Explosive appearance of cores and bootstrap percolation on lattices
Consider the process where the n vertices of a square 2-dimensional torus appear consecutively in a random order. We show that typically the size of the 3-core of the corresponding induced unit-distance graph transitions from 0 to $$n-o(n)$$ within a single step. Equivalently, by infecting the vertices of the torus in a random order, under two-neighbour bootstrap percolation, the size of the infected set transitions instantaneously from o ( n ) to n . This hitting time result answers a question of Benjamini. We also study the much more challenging and general setting of bootstrap percolation on two-dimensional lattices for a variety of finite-range infection rules. In this case, powerful but fragile bootstrap percolation tools such as the rectangles process and the Aizenman–Lebowitz lemma become unavailable. We develop a new method complementing and replacing these standard techniques, thus allowing us to prove the above hitting time result for a wide family of threshold bootstrap percolation rules on the 2-dimensional square lattice, including neighbourhoods given by large $$\ell ^p$$ balls for $$p\in [1,\infty ]$$ .- 27 April 2026
- Published by Springer Nature in Combinatorica
- Vol. 46 (3) , 17
Open AccessExplosive appearance of cores and bootstrap percolation on lattices
Consider the process where the n vertices of a square 2-dimensional torus appear consecutively in a random order. We show that typically the size of the 3-core of the corresponding induced unit-distance graph transitions from 0 to $$n-o(n)$$ within a single step. Equivalently, by infecting the vertices of the torus in a random order, under two-neighbour bootstrap percolation, the size of the infected set transitions instantaneously from o ( n ) to n . This hitting time result answers a question of Benjamini. We also study the much more challenging and general setting of bootstrap percolation on two-dimensional lattices for a variety of finite-range infection rules. In this case, powerful but fragile bootstrap percolation tools such as the rectangles process and the Aizenman–Lebowitz lemma become unavailable. We develop a new method complementing and replacing these standard techniques, thus allowing us to prove the above hitting time result for a wide family of threshold bootstrap percolation rules on the 2-dimensional square lattice, including neighbourhoods given by large $$\ell ^p$$ balls for $$p\in [1,\infty ]$$ . - Open Access
On the depth of depth-weighted trees
The depth-weighted tree DWT($f$) with weight function $f:\{0,1,2,\ldots\}\to (0,\infty)$ is a dynamic random tree grown from a root $r$ where vertices arrive consecutively and every new vertex attaches to a parent $u$ with probability proportional to $f$(distance between $u$ and $r$). This work is dedicated to a systematic analysis of the depth of DWT($f$). Namely, we provide precise analytic expressions of the typical depth of DWT($f$) for convergent, periodic, slowly growing, and (super-)exponentially growing weight functions. Furthermore, for bounded or exponentially growing $f$, we determine the typical depth up to a multiplicative constant, thus confirming and strengthening a conjecture of Leckey, Mitsche and Wormald.Open AccessOn the depth of depth-weighted trees
The depth-weighted tree DWT($f$) with weight function $f:\{0,1,2,\ldots\}\to (0,\infty)$ is a dynamic random tree grown from a root $r$ where vertices arrive consecutively and every new vertex attaches to a parent $u$ with probability proportional to $f$(distance between $u$ and $r$). This work is dedicated to a systematic analysis of the depth of DWT($f$). Namely, we provide precise analytic expressions of the typical depth of DWT($f$) for convergent, periodic, slowly growing, and (super-)exponentially growing weight functions. Furthermore, for bounded or exponentially growing $f$, we determine the typical depth up to a multiplicative constant, thus confirming and strengthening a conjecture of Leckey, Mitsche and Wormald. - Open Access
Approximate Itai-Zehavi conjecture for random graphs
A famous conjecture by Itai and Zehavi states that, for every $d$-vertex-connected graph $G$ and every vertex $r$ in $G$, there are $d$ spanning trees of $G$ such that, for every vertex $v$ in $G\setminus \{r\}$, the paths between $r$ and $v$ in different trees are internally vertex-disjoint. We show that with high probability the Itai-Zehavi conjecture holds asymptotically for the Erdős-Rényi random graph $G(n,p)$ when $np= ω(\log n)$ and for random regular graphs $G(n,d)$ when $d= ω(\log n)$. Moreover, we essentially confirm the conjecture up to a constant factor for sparser random regular graphs. This answers positively a question of Draganić and Krivelevich. Our proof makes use of recent developments on sprinkling techniques in random regular graphs.Open AccessApproximate Itai-Zehavi conjecture for random graphs
A famous conjecture by Itai and Zehavi states that, for every $d$-vertex-connected graph $G$ and every vertex $r$ in $G$, there are $d$ spanning trees of $G$ such that, for every vertex $v$ in $G\setminus \{r\}$, the paths between $r$ and $v$ in different trees are internally vertex-disjoint. We show that with high probability the Itai-Zehavi conjecture holds asymptotically for the Erdős-Rényi random graph $G(n,p)$ when $np= ω(\log n)$ and for random regular graphs $G(n,d)$ when $d= ω(\log n)$. Moreover, we essentially confirm the conjecture up to a constant factor for sparser random regular graphs. This answers positively a question of Draganić and Krivelevich. Our proof makes use of recent developments on sprinkling techniques in random regular graphs. - Open Access
Nearly spanning cycle in the percolated hypercube
Let $Q^d$ be the $d$-dimensional binary hypercube. We form a random subgraph $Q^d_p\subseteq Q^d$ by retaining each edge of $Q^d$ independently with probability $p$. We show that, for every constant $\varepsilon>0$, there exists a constant $C=C(\varepsilon)>0$ such that, if $p\ge C/d$, then with high probability $Q^d_p$ contains a cycle of length at least $(1-\varepsilon)2^d$. This confirms a long-standing folklore conjecture, stated in particular by Condon, Espuny Díaz, Girão, Kühn, and Osthus [Hamiltonicity of random subgraphs of the hypercube, Mem. Amer. Math. Soc. 305 (2024), No. 1534].Open AccessNearly spanning cycle in the percolated hypercube
Let $Q^d$ be the $d$-dimensional binary hypercube. We form a random subgraph $Q^d_p\subseteq Q^d$ by retaining each edge of $Q^d$ independently with probability $p$. We show that, for every constant $\varepsilon>0$, there exists a constant $C=C(\varepsilon)>0$ such that, if $p\ge C/d$, then with high probability $Q^d_p$ contains a cycle of length at least $(1-\varepsilon)2^d$. This confirms a long-standing folklore conjecture, stated in particular by Condon, Espuny Díaz, Girão, Kühn, and Osthus [Hamiltonicity of random subgraphs of the hypercube, Mem. Amer. Math. Soc. 305 (2024), No. 1534].