Sidorenko's conjecture for blow-ups
暂无分享,去创建一个
[1] B. Szegedy. An information theoretic approach to Sidorenko's conjecture , 2014, 1406.6738.
[2] Alexander A. Razborov,et al. Flag algebras , 2007, Journal of Symbolic Logic.
[3] Jeong Han Kim,et al. Sidorenko's conjecture for higher tree decompositions , 2018, 1805.02238.
[4] Hamed Hatami. Graph norms and Sidorenko’s conjecture , 2008, 0806.0047.
[5] R. A. R. A Z B O R O V. On the minimal density of triangles in graphs , 2008 .
[6] Christian Reiher,et al. The clique density theorem , 2012, 1212.2454.
[7] D. Conlon,et al. An Approximate Version of Sidorenko’s Conjecture , 2010, 1004.4236.
[8] David Conlon,et al. Some advances on Sidorenko's conjecture , 2015, J. Lond. Math. Soc..
[9] Benny Sudakov,et al. Dependent random choice , 2009, Random Struct. Algorithms.
[10] David Conlon,et al. Finite reflection groups and graph norms , 2016, 1611.05784.
[11] Vladimir Nikiforov,et al. The number of cliques in graphs of given order and size , 2007, 0710.2305.
[12] Miklós Simonovits,et al. Supersaturated graphs and hypergraphs , 1983, Comb..
[13] B. Szegedy,et al. On the logarithimic calculus and Sidorenko's conjecture , 2011, 1107.1153.
[14] Jeong Han Kim,et al. Two Approaches to Sidorenko's Conjecture , 2013, 1310.4383.
[15] Alexander Sidorenko,et al. A correlation inequality for bipartite graphs , 1993, Graphs Comb..