Problems and Results for Geometric Graphs and Hypergraphs

Series
Combinatorics Seminar
Time
Friday, October 24, 2025 - 3:15pm for 1 hour (actually 50 minutes)
Location
Skiles 005
Speaker
Jacques Verstraëte – University of California San Diego – jacques@ucsd.eduhttps://annatar0.wixsite.com/website-4
Organizer
Jiaxi Nie

A geometric graph consists of a set of points in the plane together with line 

segments between some pairs of points. A convex geometric graph is a geometric graph whose 

points are in convex position. We present some old and new extremal results and applications, 

and their extension to geometric hypergraphs, together with a variety of open problems. 

 

Partly joint work with Zoltan Furedi, Tao Jiang, Sasha Kostochka and Dhruv Mubayi