1 citations · 1 across the 1 of their papers we have counts for
5 papers
An arithmetic variant of Raynaud's theorem
Jonathan Love, Libby Taylor
It is well known that for a regular semistable curve over a DVR with algebraically closed residue field, the spanning trees of the dual graph of the special fiber of…
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…
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…
The k-planar crossing number of random graphs and random regular graphs
John Asplund, Thao Do, Arran Hamm +3
We give an explicit extension of Spencer's result on the biplanar crossing number of the Erdos-Renyi random graph . In particular, we show that the k-planar crossing number…
The Graph of Critical Pairs of a Crown
Fidel Barrera-Cruz, Rebecca Garcia, Pamela Harris +5
There is a natural way to associate with a poset a hypergraph , called the hypergraph of critical pairs, so that the dimension of is exactly equal to the chromatic numbe…