Honors Oral Exam

Embeddings of weighted graphs in Erd\H{o}s-type settings

David Soukup, UofR

Tuesday, May 1st, 2018
11:00 AM - 12:00 PM
Hylan 102

Many recent results in combinatorics concern the relationship between the size of a set and the number of distances determined by pairs of points in the set. One extension of this question considers configurations within the set with a specified pattern of distances.

In this talk, I will use graph-theoretic techniques to answer some of these questions.

Event contact: hazel dot mcknight at rochester dot edu