The following pages link to Lyuben Lichev (Q2030740):
Displaying 12 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)
- 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)
- Large monochromatic components in colorings of complete hypergraphs (Q6126163) (← links)
- Brownian snails with removal die out in one dimension (Q6177632) (← links)
- New results for the random nearest neighbor tree (Q6376307) (← links)
- Conflict-free hypergraph matchings (Q6398901) (← links)
- Percolation on dense random graphs with given degrees (Q6500105) (← links)
