The following pages link to Lyuben Lichev (Q2030740):
Displayed 29 items.
- A note on the Erdős-Szekeres theorem in two dimensions (Q2030741) (← links)
- On the chromatic number of the preferential attachment graph (Q2033902) (← links)
- Localization game for random geometric graphs (Q2107488) (← links)
- Local boxicity (Q2122684) (← links)
- New constructions related to the polynomial sphere recognition problem (Q2136838) (← links)
- On the boxicity of Kneser graphs and complements of line graphs (Q2689506) (← links)
- On the Power of Choice for Boolean Functions (Q5099100) (← links)
- On the modularity of 3‐regular random graphs and random graphs with given degree sequences (Q6052476) (← links)
- The giant component after percolation of product graphs (Q6057661) (← links)
- On the first and second largest components in the percolated random geometric graph (Q6072910) (← links)
- The jump of the clique chromatic number of random graphs (Q6076219) (← links)
- Color-avoiding percolation of random graphs: between the subcritical and the intermediate regime (Q6080191) (← links)
- On the minimum bisection of random 3-regular graphs (Q6106297) (← links)
- Large monochromatic components in colorings of complete hypergraphs (Q6126163) (← links)
- Brownian snails with removal die out in one dimension (Q6177632) (← links)
- New Constructions related to the Polynomial Sphere Recognition Problem (Q6335901) (← links)
- On the Decycling Number of $4$-regular Random Graphs (Q6335917) (← links)
- On the Boxicity of Kneser Graphs and Complements of Line Graphs (Q6366966) (← links)
- New results for the random nearest neighbor tree (Q6376307) (← links)
- Annulus graphs in $\mathbb R^d$ (Q6385978) (← links)
- The semi-random tree process (Q6396580) (← links)
- Conflict-free hypergraph matchings (Q6398901) (← links)
- Dynamic random graphs with vertex removal (Q6404641) (← links)
- On the $(6,4)$-problem of Brown, Erd\H{o}s and S\'os (Q6412247) (← links)
- Color-avoiding percolation on the Erd\H{o}s-R\'enyi random graph (Q6418877) (← links)
- Lower bound on the running time of Pop-Stack Sorting on a random permutation (Q6420935) (← links)
- Label propagation on binomial random graphs (Q6425736) (← links)
- Sharp threshold for embedding balanced spanning trees in random geometric graphs (Q6430776) (← links)
- Local dimer dynamics in higher dimensions (Q6433885) (← links)