4 citations · 5 across the 7 of their papers we have counts for
14 papers · 1 filter
On the maximum diameter of -colorable graphs
Éva Czabarka, Inne Singgih, László A. Székely
Erdős, Pach, Pollack and Tuza [J. Combin. Theory, B 47, (1989), 279-285] conjectured that the diameter of a -free connected graph of order and minimum degree …
An infinite antichain of planar tanglegrams
Éva Czabarka, Stephen J. Smith, László A. Székely
Contrary to the expectation arising from the tanglegram Kuratowski theorem of É. Czabarka, L.A. Székely and S. Wagner [SIAM J. Discrete Math. 31(3): 1732--1750, (2017)], we constru…
The Steiner distance problem for large vertex subsets in the hypercube
Éva Czabarka, Josiah Reiswig, László Székely
We find the asymptotic behavior of the Steiner k-diameter of the -cube if is large. Our main contribution is the lower bound, which utilizes the probabilistic method.
Some remarks on the midrange crossing constant
É. Czabarka, I. Singgih, L. A. Székely +1
We verify an upper bound of Pach and Tóth [Combinatorica 17(1997), 427-439, Discrete and Computational Geometry 36(2006), 527-552] on the midrange crossing constant. Details of the…
A Size Condition for Diameter Two Orientable Graphs
Garner Cochran, Éva Czabarka, Peter Dankelmann +1
It was conjectured by Koh and Tay [Graphs Combin. 18(4) (2002), 745--756] that for every simple graph of order and size at least has an orientation…
Using Block Designs in Crossing Number Bounds
John Asplund, Eva Czabarka, Gregory Clark +6
The crossing number ${\mbox {cr}}(G)$ of a graph is the smallest number of edge crossings over all drawings of in the plane. For any , the -planar crossing…