LSLászló Székely

László Székely

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


László Székely has a total of 77 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    ON AGREEMENT SUBTREES IN MULTIPLE PHYLOGENETIC TREES

    by Bryan Currie, Éva Czabarka, Henry Simmons, Mareike Fischer, László Székely, Kristina Wicke

    Snir and Yuster [Discrete Appl. Math. 347(2026) 160–171] asked for theleast number h(k) such that k unrooted binary phylogenetic trees on the same h(k) leavesalways share a common quartet. We give a new upper bound for the k-tree version of theMaximum Agreement Subtree problem, namely an upper bound for the number of leaves,on which k unrooted binary phylogenetic trees always share a common induced binarysubtree on n leaves, which is a four-times iterated exponential function. For h(k), thisimplies a four-times iterated exponential upper bound. We also set an exponential lowerbound for h(k).

  • Open Access

    Tanglegrams with a Unique 1-Crossing-Critical Subtanglegram have Tangle Crossing Number 1

    by Éva Czabarka, Alec Helm, László Székely

    A tanglegram of size n is a graph formed from two rooted binary trees with n leaves each and a perfect matching between their leaf sets. Tanglegrams are used to model co-evolution in various settings. A tanglegram layout is a straight line drawing where the two trees are drawn as plane trees with their leaf-sets on two parallel lines, and only the edges of the matching may cross. The tangle crossing number of a tanglegram is the minimum crossing number among its layouts. It is known that tanglegrams have crossing number at least one precisely when they contain one of two size 4 subtanglegrams, which we refer to as cross-inducing subtanglegrams. We show here that a tanglegram with exactly one cross inducing subtanglegram must have tangle crossing number exactly one, and ask the question whether the tangle-crossing number of tanglegrams with exactly k cross-inducing subtanglegrams is bounded for every k.

  • Open Access

    A note on the 2-colored rectilinear crossing number of random point sets in the unit square

    by S. Cabello, É Czabarka, R. Fabila-Monroy, Y. Higashikawa, R. Seidel, L. Székely, J. Tkadlec, A. Wesolek


  • Open Access

    The Largest Crossing Number of Tanglegrams

    by Éva Czabarka, Junsheng Liu, László Székely

    A tanglegram $\mathcal{T}$ consists of two rooted binary trees with the same number of leaves, and a perfect matching between the two leaf sets. In a layout, the tanglegrams is drawn with the leaves on two parallel lines, the trees on either side of the strip created by these lines are drawn as plane trees, and the perfect matching is drawn in straight line segments inside the strip. The tanglegram crossing number ${\rm cr}({\mathcal{T}})$ of $\mathcal{T}$ is the smallest number of crossings of pairs of matching edges, over all possible layouts of $\mathcal{T}$. The size of the tanglegram is the number of matching edges, say $n$. An earlier paper showed that the maximum of the tanglegram crossing number of size $n$ tanglegrams is $<\frac{1}{2}\binom{n}{2}$; but is at least $\frac{1}{2}\binom{n}{2}-\frac{n^{3/2}-n}{2}$ for infinitely many $n$. Now we make better bounds: the maximum crossing number of a size $n$ tanglegram is at most $\frac{1}{2}\binom{n}{2}-\frac{n}{4}$, but for infinitely many $n$, at least $\frac{1}{2}\binom{n}{2}-\frac{n\log_2 n}{4}$. The problem shows analogy with the Unbalancing Lights Problem of Gale and Berlekamp.

  • Open Access

    A Note on the 2-Colored Rectilinear Crossing Number of Random Point Sets in the Unit Square

    by Sergio Cabello, Éva Czabarka, Ruy Fabila-Monroy, Yuya Higashikawa, Raimund Seidel, László Székely, Josef Tkadlec, Alexandra Wesolek

    Let $S$ be a set of four points chosen independently, uniformly at random from a square. Join every pair of points of $S$ with a straight line segment. Color these edges red if they have positive slope and blue, otherwise. We show that the probability that $S$ defines a pair of crossing edges of the same color is equal to $1/4$. This is connected to a recent result of Aichholzer et al. [GD 2019] who showed that by 2-colouring the edges of a geometric graph and counting monochromatic crossings instead of crossings, the number of crossings can be more than halfed. Our result shows that for the described random drawings, there is a coloring of the edges such that the number of monochromatic crossings is in expectation $\frac{1}{2}-\frac{7}{50}$ of the total number of crossings.

  • Open Access

    Decks of rooted binary trees

    by Ann Clifton, Eva Czabarka, Audace Dossou-Olory, Kevin Liu, Sarah Loeb, Utku Okur, Laszlo Szekely, Kristina Wicke

    We consider extremal problems related to decks and multidecks of rooted binary trees (a.k.a. rooted phylogenetic tree shapes). Here, the deck (resp. multideck) of a tree $T$ refers to the set (resp. multiset) of leaf induced binary subtrees of $T$. On the one hand, we consider the reconstruction of trees from their (multi)decks. We give lower and upper bounds on the minimum (multi)deck size required to uniquely encode a rooted binary tree on $n$ leaves. On the other hand, we consider problems related to deck cardinalities. In particular, we characterize trees with minimum-size as well as maximum-size decks. Finally, we present some exhaustive computations for $k$-universal trees, i.e., rooted binary trees that contain all $k$-leaf rooted binary trees as induced subtrees.

  • Open Access

    Universal rooted phylogenetic tree shapes and universal tanglegrams

    by Ann Clifton, Eva Czabarka, Kevin Liu, Sarah Loeb, Utku Okur, Laszlo Szekely, Kristina Wicke

    We provide an $Ω(n\log n) $ lower bound and an $O(n^2)$ upper bound for the smallest size of rooted binary trees (a.k.a. phylogenetic tree shapes), which are universal for rooted binary trees with $n$ leaves, i.e., contain all of them as induced binary subtrees. We explicitly compute the smallest universal trees for $n\leq 11$. We also provide an $Ω(n^2) $ lower bound and an $O(n^4)$ upper bound for the smallest size of tanglegrams, which are universal for size $n$ tanglegrams, i.e., which contain all of them as induced subtanglegrams. Some of our results generalize to rooted $d$-ary trees and to $d$-ary tanglegrams.

  • Open Access

    Proximity in triangulations and quadrangulations

    by Éva Czabarka, Peter Dankelmann, Trevor Olsen, László Székely

    Let G be a connected graph. If σ(v) denotes the arithmetic mean of the distances from v to all other vertices of G, then the proximity, π(G), of G is defined as the smallest value of σ(v) over all vertices v of G. We give upper bounds for the proximity of simple triangulations and quadrangulations of given order and connectivity. We also construct simple triangulations and quadrangulations of given order and connectivity that match the upper bounds asymptotically and are likely optimal.


  • Minimum Wiener index of triangulations and quadrangulations

    by Éva Czabarka, Trevor V. Olsen, Stephen J. Smith, László Székely


  • Maximum diameter of 3‐ and 4‐colorable graphs

    by Éva Czabarka, Stephen J. Smith, László Székely

    Erdős et al. made conjectures for the maximum diameter of connected graphs without a complete subgraph , which have order and minimum degree . Settling a weaker version of a problem, by strengthening the ‐free condition to ‐colorable, we solve the problem for and using a unified linear programming duality approach. The case is a substantial simplification of the result of Czabarka et al.