Turán numbers and switching

Karen Gunderson, Jason Semeraro

Using a switching operation on tournaments we obtain some new lower bounds on the Turán number of the $r$-graph on $r+1$ vertices with $3$ edges. For $r=4$, extremal examples were…