Combinatorics Seminar

On the Erdős 3-chain in the plane

Jonathan Passant

Thursday, June 11th, 2020
3:00 PM - 4:00 PM
Zoom ID: 797681224

Let be a finite subset of , Erdős asked how the number of distinct distances grows as the size of grows. We examine a graphical variant of this problem asking how many distinct realizations the graph can have with vertices in the set , as grows. We present recent progress that establishes essentially sharp bounds for this question for almost all graphs on four vertices.

Event contact: iosevich at gmail dot com