Lyuben Lichev

From MaRDI portal
Person:2030740



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
\(d\)-connectivity of the random graph with restricted budget
Journal of Graph Theory
2025-01-06Paper
Sharp threshold for embedding balanced spanning trees in random geometric graphs
Journal of Graph Theory
2024-08-30Paper
On the \((6,4)\)-problem of Brown, Erdős, and Sós
Proceedings of the American Mathematical Society. Series B
2024-06-27Paper
Annulus graphs in \(\mathbb{R}^d\)
Discrete & Computational Geometry
2024-06-21Paper
The maximal running time of hypergraph bootstrap percolation
SIAM Journal on Discrete Mathematics
2024-05-22Paper
Conflict-free hypergraph matchings2024-05-14Paper
Percolation on dense random graphs with given degrees
Journal of Combinatorial Theory. Series B
2024-05-10Paper
Large monochromatic components in colorings of complete hypergraphs
Journal of Combinatorial Theory. Series A
2024-04-09Paper
Brownian snails with removal die out in one dimension
Electronic Communications in Probability
2024-01-17Paper
Color-avoiding percolation of random graphs: between the subcritical and the intermediate regime
Discrete Mathematics
2023-10-30Paper
The jump of the clique chromatic number of random graphs
Random Structures & Algorithms
2023-10-23Paper
On the modularity of 3‐regular random graphs and random graphs with given degree sequences
Random Structures & Algorithms
2023-10-17Paper
The giant component after percolation of product graphs
Journal of Graph Theory
2023-10-05Paper
On the first and second largest components in the percolated random geometric graph
Stochastic Processes and their Applications
2023-09-15Paper
On the minimum bisection of random 3-regular graphs
The Electronic Journal of Combinatorics
2023-06-27Paper
Local dimer dynamics in higher dimensions2023-04-21Paper
Sharp threshold for embedding balanced spanning trees in random geometric graphs2023-03-24Paper
On the boxicity of Kneser graphs and complements of line graphs
Discrete Mathematics
2023-03-10Paper
Label propagation on binomial random graphs2023-02-07Paper
Lower bound on the running time of Pop-Stack Sorting on a random permutation2022-12-19Paper
Localization game for random geometric graphs
European Journal of Combinatorics
2022-12-01Paper
Color-avoiding percolation on the Erd\H{o}s-R\'enyi random graph2022-11-29Paper
On the $(6,4)$-problem of Brown, Erd\H{o}s and S\'os2022-09-28Paper
On the power of choice for Boolean functions
SIAM Journal on Discrete Mathematics
2022-08-31Paper
Dynamic random graphs with vertex removal2022-07-11Paper
New constructions related to the polynomial sphere recognition problem
Discrete & Computational Geometry
2022-05-16Paper
Conflict-free hypergraph matchings2022-05-11Paper
The semi-random tree process2022-04-15Paper
Local boxicity
European Journal of Combinatorics
2022-04-07Paper
Annulus graphs in $\mathbb R^d$2021-12-17Paper
New results for the random nearest neighbor tree2021-08-30Paper
On the chromatic number of the preferential attachment graph
European Journal of Combinatorics
2021-06-18Paper
A note on the Erdős-Szekeres theorem in two dimensions
The Electronic Journal of Combinatorics
2021-06-07Paper
On the Boxicity of Kneser Graphs and Complements of Line Graphs
(available as arXiv preprint)
2021-05-06Paper
New Constructions related to the Polynomial Sphere Recognition Problem
(available as arXiv preprint)
2020-03-01Paper
On the Decycling Number of $4$-regular Random Graphs2020-03-01Paper
$d$-connectivity of the random graph with restricted budget
(available as arXiv preprint)
N/APaper
The maximal running time of hypergraph bootstrap percolation
(available as arXiv preprint)
N/APaper
Zero-sum Random Games on Directed Graphs
(available as arXiv preprint)
N/APaper
On the $(k+2,k)$-problem of Brown, Erd\H{o}s and S\'os for $k=5,6,7$
(available as arXiv preprint)
N/APaper


Research outcomes over time


This page was built for person: Lyuben Lichev