Department of

May 2020June 2020July 2020 Su Mo Tu We Th Fr Sa Su Mo Tu We Th FrSaSu Mo Tu We Th Fr Sa 1 2 1 2 3 4 561 2 3 4 3 4 5 6 7 8 9 7 8 9 10 11 12 13 5 6 7 8 9 10 11 10 11 12 13 14 15 16 14 15 16 17 18 19 20 12 13 14 15 16 17 18 17 18 19 20 21 22 23 21 22 23 24 25 26 27 19 20 21 22 23 24 25 24 25 26 27 28 29 30 28 29 30 26 27 28 29 30 31 31

Tuesday, June 2, 2020

**Abstract:** For any $r\geq 2$, an $r$-uniform hypergraph $\mathcal{H}$, and integer $n$, the Turan number for $\mathcal{H}$ is the maximum number of hyperedges in any $r$-uniform hypergraph on $n$ vertices containing no copy of $\mathcal{H}$. While the Turan numbers of graphs are well-understood and exact Turan numbers are known for some classes of graphs, few exact results are known for the cases $r \geq 3$. I will present a construction, using quadratic residues, for an infinite family of hypergraphs having no copy of the $4$-uniform hypergraph on $5$ vertices with $3$ hyperedges, with the maximum number of hyperedges subject to this condition. I will also describe a connection between this construction and a `switching' operation on tournaments, with applications to finding new bounds on Turan numbers for other small hypergraphs.

Please email Sean at SEnglish@illinois.edu for the Zoom ID and password.