# László Székely

*University of South Carolina*

### IMI Preprints

- Biplanar crossing numbers II: comparing crossing numbers and biplanar crossing numbers using the probabilistic method (2006)
- Inverting random functions III: discrete MLE revisited (2006)
- Using Lovász local lemma in the space of random injections (2006)
- Teasing apart two trees (2005)
- On the variational distance of two trees (2005)
- Counting rooted spanning forests in complete multipartite graphs (2004)
- Non-trivial t-intersection in the function lattice (2004)
- Outerplanar crossing numbers, circular arrangement problem, and isoparametric functions (2004)
- On subtrees of trees (2004)
- The gap between crossing numbers and convex crossing numbers (2003)
- Short proof for a theorem of Pach, Spencer and Tóth (2003)
- Binary trees with the largest number of subtrees (2003)
- A successful concept for measuring non-planarity of graphs: The crossing number (2002)
- Biplanar crossing numbers I: A survey of results and problems (2002)
- Inverting random functions II: explicit bounds for parametric and non-parametric MLE, with applications (2001)
- Wiener index versus maximum degree in trees (2001)
- Erdős on unit distances and the Szemerédi-Trotter theorems (2000)
- A successful concept for measuring non-planarity of graphs: the crossing number (2000)
- Inverting random functions (1999)
- Towards a Katona type proof for the 2-intersecting Erdős-Ko-Rado theorem (1999)
- A few logs suffice to build (almost) all trees (I) (1998)
- A few logs suffice to build (almost) all trees (II) (1998)
- Constructing integral uniform flows in symmetric networks with application to the edge-forwarding index problem (1998)
- On bipartite drawings and the linear arrangement problem (1998)
- A new lower bound for the bipartite crossing number with applications (1998)
- The short quartet method (1998)

### IMI Seminars