A bound on similar structures in 3-uniform hypergraphs
Owen Jianwen Zhang
Second place · Regeneron STS 2025
A proof establishing a maximum for how many 3-uniform hypergraphs can share a structure while differing in their connections, resolving a question that had stood open, with applications in computer science.
- combinatorics
- hypergraphs
- extremal-combinatorics
- +1