12 citations · 49 across the 21 of their papers we have counts for
Showing 2016Show all
3 papers · 1 filter
math.CO2016★ 12 cited
Note on k-planar crossing numbers
János Pach, László A. Székely, Csaba D. Tóth +1
The crossing number of a graph is the smallest number of edge crossings over all drawings of in the plane. For any , the -planar crossing number of…
math.CO2016
Inducibility in binary trees and crossings in random tanglegrams
Éva Czabarka, László A. Székely, Stephan Wagner
In analogy to other concepts of a similar nature, we define the inducibility of a rooted binary tree. Given a fixed rooted binary tree with leaves, we let be the p…
math.CO2016
On the number of nonisomorphic subtrees of a tree
Éva Czabarka, László A. Székely, Stephan Wagner
We show that a tree of order has at most nonisomorphic subtrees, and that this bound is best possible. We also prove an analogous result for the number of nonisomo…