- Series
- Graph Theory Seminar
- Time
- Tuesday, April 28, 2026 - 3:30pm for 1 hour (actually 50 minutes)
- Location
- Skiles 005
- Speaker
- Amanda Priestley – UT Austin – https://mndpriestley.github.io/
- Organizer
- Xiying Du and Rose McCarty
An $r$-sunflower is a collection of $r$ sets such that the intersection of any two sets in the collection is identical. We analyze a random process which constructs a $w$-uniform $r$-sunflower free family starting with an empty family, and at each step, adding a set chosen uniformly at random from all choices that could be added without creating an $r$-sunflower with the previously chosen sets. To analyze this process, we extend results of Bennett and Bohman (arXiv:1308.3732v5 [math.CO]) who analyzed a general random process which adds one object at a time chosen uniformly at random from all objects that can be added without creating certain forbidden subsets. This talk is based on joint work with Professor Patrick Bennett.