The celebrated Andr\'{a}sfai--Erd\H{o}s--S\'{o}s Theorem from 1974 shows that every n-vertex triangle-free graph with minimum degree greater than 2n/5 must be bipartite. Its extensions to 3-uniform hypergraphs without the generalized triangle F_5 = \{abc, abd, cde\} have been explored in several previous works such as~\cite{LMR23unif,HLZ24}, demonstrating the existence of $\varepsilon >... Show more