On the extremal number of subdivisions by Conlon, D, Lee, J

“…More precisely, we show that if H is a C4-free bipartite graph with maximum degree 2 on one side, then there are positive constants C and δ such that every graph with n vertices and Cn3/2−δ edges contains a copy of H⁠. …”

Sidorenko's conjecture, graph norms, and pseudorandomness by Lee, J

“…This conjecture is closely related to Sidorenko's conjecture in the sense that it is true for every bipartite graph H that satisfies Sidorenko's conjecture. …”

Some advances on Sidorenko's conjecture by Conlon, D, Kim, J, Lee, C, Lee, J

“…In this paper, we provide three distinct families of bipartite graphs that have Sidorenko's property. First, using branching random walks, we develop an embedding algorithm which allows us to prove that bipartite graphs admitting a certain type of tree decomposition have Sidorenko's property. …”

Finite reflection groups and graph norms by Conlon, D, Lee, J

“…In the other direction, Hatami showed that even cycles, complete bipartite graphs, and hypercubes are all weakly norming. …”