activity
20172021
most citedThe k-planar crossing number of random graphs and random regular graphs

1 citations · 1 across the 1 of their papers we have counts for

collaborators
Showing 2018Show all

2 papers · 1 filter

math.CO2018

Kasteleyn cokernels and perfect matchings on planar bipartite graphs

Libby Taylor

The determinant method of Kasteleyn gives a method of computing the number of perfect matchings of a planar bipartite graph. In addition, results of Bernardi exhibit a bijection be…

math.CO2018

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…