Ten Challenges 04: Sidorenko's conjecture for bipartite graphs with bounded sidesOpen Problem
How many copies of a fixed graph must a graph of given edge density contain? For bipartite , Sidorenko's conjecture gives the cleanest possible answer: the random graph of the same density contains the fewest, so the homomorphism density of in is at least the edge density of raised to the number of edges of . The statement was conjectured…
9 thms3 active usersReviewed