- Series
- Graph Theory Seminar
- Time
- Tuesday, November 3, 2020 - 3:45pm for 1 hour (actually 50 minutes)
- Location
- https://us04web.zoom.us/j/77238664391. For password, please email Anton Bernshteyn (bahtoh ~at~ gatech.edu)
- Speaker
- Ruth Luo – University of California, San Diego – ruluo@ucsd.edu – https://math.ucsd.edu/~ruluo/
- Organizer
- Anton Bernshteyn
Let F be a graph. We say a hypergraph H is a trace of F if there exists a bijection ϕ from the edges of F to the hyperedges of H such that for all xy∈E(F), ϕ(xy)∩V(F)={x,y}. In this talk, we show asymptotics for the maximum number of edges in an r-uniform hypergraph that does not contain a trace of F. We also obtain better bounds in the case F=K2,t. This is joint work with Zoltán Füredi and Sam Spiro.