52 citations · 65 across the 12 of their papers we have counts for
Showing 2017Show all
3 papers · 1 filter
math.CO2017★ 1 cited
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…
math.CO2017★ 1 cited
Representation Complexity of Semi-algebraic Graphs
Thao Do
The representation complexity of a bipartite graph is the minimum size over all possible ways to write as a (not necessarily disjoint) un…
math.CO2017★ 1 cited
Zarankiewicz's problem for semi-algebraic hypergraphs
Thao Do
Zarankiewicz's problem asks for the largest possible number of edges in a graph that does not contain a subgraph for a fixed positive integer . Recently, Fox, Pach, Sh…