Past Events
Daniel Zhu - Hypercube Turán problems
Location: Hill 705
Date & time: Monday, 01 December 2025 at 2:00PM - 3:00PM
Speaker: Daniel Zhu (Princeton)
Title: Hypercube Turán problems
Abstract: What is the smallest subset of the hypercube {0, 1}^n that intersects every two-dimensional face? What is the largest subgraph of the hypercube graph Q_n that doesn't contain an 8-cycle? These questions are all examples of Turán problems on the hypercube, where we seek the minimum size of a subset (of either vertices and edges) of the hypercube that guarantees the existence of a certain structure. We discuss a framework for tackling such questions and some unexpected connections to structural graph theory and matroids.
Special Note to All Travelers
Directions: map and driving directions. If you need information on public transportation, you may want to check the New Jersey Transit page.
Unfortunately, cancellations do occur from time to time. Feel free to call our department: 848-445-6969 before embarking on your journey. Thank you.