John C. Urschel

activity

20172023

most citedLearning Determinantal Point Processes with Moments and Cycles

8 citations · 19 across the 8 of their papers we have counts for

collaborators

Showing math.COShow all

4 papers · 1 filter

math.CO2021

Maximum spread of graphs and bipartite graphs

Jane Breen, Alex W. N. Riasanovsky, Michael Tait +1

Given any graph $G$ , the (adjacency) spread of $G$ is the maximum absolute difference between any two eigenvalues of the adjacency matrix of $G$ . In this paper, we resolve a pair o…

math.CO2020

Regarding two conjectures on clique and biclique partitions

Dhruv Rohatgi, John C. Urschel, Jake Wellens

For a graph $G$ , let $c p (G)$ denote the minimum number of cliques of $G$ needed to cover the edges of $G$ exactly once. Similarly, let $b p_{k} (G)$ denote the minimum number of bicliq…

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…

math.CO2019

Testing Gap k-planarity is NP-complete

John C. Urschel, Jake Wellens

For all $k \geq 1$ , we show that deciding whether a graph is $k$ -planar is NP-complete, extending the well-known fact that deciding 1-planarity is NP-complete. Furthermore, we show…