66 citations · 187 across the 28 of their papers we have counts for
4 papers · 1 filter
Book drawings of complete bipartite graphs
Etienne de Klerk, Dmitrii V. Pasechnik, Gelasio Salazar
A "book" with k pages consists of a straight line (the "spine") and k half-planes (the "pages"), such that the boundary of each page is the spine. If a graph is drawn on a book wit…
Improved lower bounds on book crossing numbers of complete graphs
Etienne de Klerk, Dmitrii V. Pasechnik, Gelasio Salazar
A "book with k pages" consists of a straight line (the "spine") and k half-planes (the "pages"), such that the boundary of each page is the spine. If a graph is drawn on a book wit…
Improved lower bounds for the 2-page crossing numbers of K_{m,n} and K_n via semidefinite programming
Etienne de Klerk, Dmitrii V. Pasechnik
It has been long conjectured that the crossing numbers of the complete bipartite graph K_{m,n} and of the complete graph K_n equal Z(m,n) (the value conjectured by Zarankiewicz, wh…
Improved bounds for the crossing numbers of K_m,n and K_n
E. de Klerk, J. Maharry, D. V. Pasechnik +2
It has been long--conjectured that the crossing number cr(K_m,n) of the complete bipartite graph K_m,n equals the Zarankiewicz Number Z(m,n):= floor((m-1)/2) floor(m/2) floor((n-1)…