Some advances on Sidorenko's conjecture
暂无分享,去创建一个
David Conlon | Jeong Han Kim | Joonkyung Lee | Choongbum Lee | Jeong Han Kim | D. Conlon | Choongbum Lee | Joonkyung Lee
[1] J. B. Kernan,et al. An Information‐Theoretic Approach* , 1971 .
[2] R. Halin. S-functions for graphs , 1976 .
[3] Paul D. Seymour,et al. Graph minors. III. Planar tree-width , 1984, J. Comb. Theory B.
[4] A. Sidorenko,et al. Inequalities for functionals generated by bipartite graphs , 1991 .
[5] Hamed Hatami. Graph norms and Sidorenko’s conjecture , 2008, 0806.0047.
[6] M. Simonovits. Extremal Graph Problems , Degenerate Extremal Problems , and Supersaturated Graphs , 2010 .
[7] D. Conlon,et al. An Approximate Version of Sidorenko’s Conjecture , 2010, 1004.4236.
[8] W. T. Gowers,et al. Combinatorial theorems in sparse random sets , 2010, 1011.4310.
[9] Yoshiharu Kohayakawa,et al. Weak hypergraph regularity and linear hypergraphs , 2010, J. Comb. Theory, Ser. B.
[10] B. Szegedy,et al. On the logarithimic calculus and Sidorenko's conjecture , 2011, 1107.1153.
[11] David Conlon,et al. Weak quasi‐randomness for uniform hypergraphs , 2012, Random Struct. Algorithms.
[12] Jeong Han Kim,et al. Two Approaches to Sidorenko's Conjecture , 2013, 1310.4383.
[13] O. Parczyk,et al. On Sidorenko's Conjecture , 2014 .
[14] B. Szegedy. An information theoretic approach to Sidorenko's conjecture , 2014, 1406.6738.
[15] Christian Reiher. Counting odd cycles in locally dense graphs , 2014, J. Comb. Theory, Ser. B.
[16] Jeong Han Kim,et al. Sidorenko's conjecture for higher tree decompositions , 2018, 1805.02238.