Andrew Suk

THE NUMBER OF EDGES IN k-QUASI-PLANAR GRAPHS

A graph drawn in the plane is called

New bounds on the maximum number of edges in k-quasi-planar graphs

k

Ramsey-type results for semi-algebraic relations

-quasi-planar if it does not contain

Coloring intersection graphs of x-monotone curves in the plane

k

A Polynomial Regularity Lemma for Semialgebraic Hypergraphs and Its Applications in Geometry and Property Testing

pairwise crossing edges. It has been conjectured for a long time that for every fixed

k -Quasi-planar graphs

k

Order Types of Convex Bodies

, the maximum number of edges of a

On grids in topological graphs

k

Disjoint edges in complete topological graphs

-quasi-planar graph with

Disjoint Edges in Complete Topological Graphs

n