8 citations · 31 across the 14 of their papers we have counts for
Showing 2020Show all
3 papers · 1 filter
math.CO2020
Regarding two conjectures on clique and biclique partitions
Dhruv Rohatgi, John C. Urschel, Jake Wellens
For a graph , let denote the minimum number of cliques of needed to cover the edges of exactly once. Similarly, let denote the minimum number of bicliq…
math.NA2020
Uniform Error Estimates for the Lanczos Method
John C. Urschel
The Lanczos method is one of the most powerful and fundamental techniques for solving an extremal symmetric eigenvalue problem. Convergence-based error estimates depend heavily on…
math.CO2020
Discrete Trace Theorems and Energy Minimizing Spring Embeddings of Planar Graphs
John C. Urschel, Ludmil T. Zikatanov
Tutte's spring embedding theorem states that, for a three-connected planar graph, if the outer face of the graph is fixed as the complement of some convex region in the plane, and…