An information theoretic approach to Sidorenko's conjecture

G.R. Blakley, P.A. Roy, A Hölder type inequality for symmetric matrices with nonnegative entries, Proc. Amer. Math. Soc

1965

Earlier work this paper cites.

M. Simonovits, Extremal graph problems, degenerate extremal problems and super-saturated graphs, in “Progress in Graph Theory (Waterloo, Ont., 1982)”, Academic Press, Toronto, ON (1984), 419-437

1984

Earlier work this paper cites.

I. Benjamini, Y. Peres, A correlation inequality for tree-indexed Markov chains, in “Seminar of Stochastic Processes, Proc. Semin., Los Angeles/CA (USA) 1991”

1991

Earlier work this paper cites.

A.F Sidorenko, A correlation inequality for bipartite graphs, Graphs Combin

1993

Earlier work this paper cites.

L. Lovász, B. Szegedy, Limits of dense graph sequences, J. of Combinatorial Theory B

2006

Cited alongside, same era.

H. Hatami, Graph norms and Sidorenko’s conjecture, Israel J. Math

2010

Cited alongside, same era.

D. Conlon, J. Fox, B. Sudakov, An approximate version of Sidorenko’s conjecture, GAFA

2010

Cited alongside, same era.

X. Li, B. Szegedy, On the logarithmic calculus and Sidorenko’s conjecture, to appear

Cited in the paper.

J.H.Kim, C. Lee, J. Lee, Two approaches to Sidorenko’s conjecture, Arxiv 1310.4383

Cited in the paper.

J. Fox, B. Sudakov, Dependent random choice, Random Structures Algorithms

Cited in the paper.

H. Hatami, Serguei Norine, Undecidability of linear inequalities in graph homomorphism densities, J. Amer. Math. Soc

2011

Later among the works it cites.

Swastik Kopparty, Benjamin Rossman, The Homomorphism Domination Exponent, European J. of Comb

2011

Later among the works it cites.

L. Lovász, Subgraph Densities in Signed Graphons and the local Simonovits-Sidorenko conjecture, Electronic J. of Comb

2011

Later among the works it cites.