The step Sidorenko property and non-norming edge-transitive graphs

Sidorenko's Conjecture asserts that every bipartite graph H has the Sidorenko property, i.e., a quasirandom graph minimizes the density of H among all graphs with the same edge density. We study a stronger property, which requires that a quasirandom multipartite graph minimizes the density of H among all graphs with the same edge densities between its parts; this property is called the step Sidorenko property. We show that many bipartite graphs fail to have the step Sidorenko property and use our results to show the existence of a bipartite edge-transitive graph that is not weakly norming; this answers a question of Hatami [Israel J. Math. 175 (2010), 125-150].

[1]  Hamed Hatami.  Graph norms and Sidorenko’s conjecture , 2008, 0806.0047.

[2]  Vojtech Rödl,et al.  2-Colorings of complete graphs with a small number of monochromatic K4 subgraphs , 1993, Discret. Math..

[3]  Jan Hladký,et al.  Cut-norm and entropy minimization over weak⁎ limits , 2017, J. Comb. Theory, Ser. B.

[4]  M. Simonovits.  Extremal Graph Problems , Degenerate Extremal Problems , and Supersaturated Graphs , 2010 .

[5]  Lubos Thoma,et al.  Bipartite Subgraphs and Quasi-Randomness , 2004, Graphs Comb..

[6]  A. Goodman.  On Sets of Acquaintances and Strangers at any Party , 1959 .

[7]  Israel Rocha,et al.  Cut distance identifying graphon parameters over weak* limits , 2018, J. Comb. Theory, Ser. A.

[8]  John B. Shoven,et al.  I , Edinburgh Medical and Surgical Journal.

[9]  Andrew Thomason,et al.  Multiplicities of subgraphs , 1996, Comb..

[10]  David Conlon,et al.  Some advances on Sidorenko's conjecture , 2015, J. Lond. Math. Soc..

[11]  P ? ? ? ? ? ? ? % ? ? ? ? , 1991 .

[12]  Fan Chung Graham,et al.  Quasi-random graphs , 1988, Comb..

[13]  David Conlon,et al.  Finite reflection groups and graph norms , 2016, 1611.05784.

[14]  G. R. Blakley,et al.  A Hölder type inequality for symmetric matrices with nonnegative entries , 1965 .

[15]  D. Conlon,et al.  An Approximate Version of Sidorenko’s Conjecture , 2010, 1004.4236.

[16]  Jan Hladký,et al.  Non-Three-Colourable Common Graphs Exist , 2011, Combinatorics, Probability and Computing.

[17]  Fan Wei,et al.  On the Local Approach to Sidorenko's Conjecture , 2017, Electron. Notes Discret. Math..

[18]  J. Tabor,et al.  ICA based on the data asymmetry , 2017, 1701.09160.

[19]  B. Szegedy,et al.  On the logarithimic calculus and Sidorenko's conjecture , 2011, 1107.1153.

[20]  Danna Zhou,et al.  d. , 1934, Microbial pathogenesis.

[21]  Vojtech Rödl,et al.  Ramsey problem on multiplicities of complete subgraphs in nearly quasirandom graphs , 1992, Graphs Comb..

[22]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[23]  M. Bálek,et al.  Large Networks and Graph Limits , 2022 .

[24]  Alexander Sidorenko,et al.  A correlation inequality for bipartite graphs , 1993, Graphs Comb..

[25]  A. Thomason.  A Disproof of a Conjecture of Erdős in Ramsey Theory , 1989 .

[26]  P. Csikvári,et al.  On Sidorenko's conjecture for determinants and Gaussian Markov random fields , 2017, Random Struct. Algorithms.

[27]  László Lovász,et al.  Limits of dense graph sequences , 2004, J. Comb. Theory B.

[28]  David Conlon,et al.  Sidorenko's conjecture for blow-ups , 2018 .

[29]  B. Szegedy.  An information theoretic approach to Sidorenko's conjecture , 2014, 1406.6738.

[30]  Jeong Han Kim,et al.  Two Approaches to Sidorenko's Conjecture , 2013, 1310.4383.