Sam Spiro, Rutgers University

Abstract

Let  denote the maximum number of edges in an -free subgraph of the random -uniform hypergraph .  Following recent work of Conlon, Lee, and Sidorenko, we prove non-trivial lower bounds on  whenever  is not Sidorenko. This connection between Sidorenko's conjecture and random Turan problems gives new lower bounds on  whenever  is not Sidorenko, and further allows us to bound how ``far'' from Sidorenko an -graph  is whenever upper bounds for  are known. 
This is joint work with Jiaxi Nie.