On the Local Approach to Sidorenko's Conjecture

https://doi.org/10.1016/j.endm.2017.06.074Get rights and content

Abstract

A well-known conjecture of Erdős-Simonovits and Sidorenko states that, if H is a bipartite graph, then the random graph with edge density p has in expectation asymptotically the minimum number of copies of H over all graphs of the same number of vertices and edge density. A strengthening known as the forcing conjecture states that, if H is a bipartite graph with at least one cycle, then quasirandom graphs of density p are the only graphs of density p that asymptotically minimize the number of copies of H. Lovász proved a local version of Sidorenko's conjecture. We characterize those graphs for which Sidorenko's conjecture holds locally. Namely, it holds locally for H if and only if H has even girth or is a forest. Furthermore, a local version of the forcing conjecture holds precisely for graphs of even girth. As a corollary, we prove that for such H there is δH>0 such that Sidorenko's conjecture and the forcing conjecture holds for all p>1δH.

References (26)

  • G.R. Blakley et al.

    A Hölder type inequality for symmetric matrices with nonnegative entries

    Proc. Amer. Math. Soc.

    (1965)
  • C. Borgs et al.

    Convergent graph sequences I: subgraph frequencies, metric properties, and testing

    Adv. in Math.

    (2008)
  • D. Conlon et al.

    An approximate version of Sidorenko's Conjecture

    Geom. Funct. Anal.

    (2010)
  • D. Conlon et al.

    Some advances on Sidorenko's Conjecture

  • D. Conlon et al.

    Finite reflection groups and graph norms

  • D. Dellamonica et al.

    Tree-minimal graphs are almost regular

    J. Comb.

    (2012)
  • P. Erdős et al.

    A limit theorem in graph theory

    Studia Sci. Math. Hungar.

    (1966)
  • P. Erdős et al.

    On the structure of linear graphs

    Bull. Amer. Math. Soc.

    (1946)
  • J. Fox, F. Wei, On the local approach to Sidorenko conjecture, in...
  • H. Hatami

    Graph norms and Sidorenkos Conjecture

    Israel J. Math.

    (2010)
  • J.H. Kim et al.

    Two approaches to Sidorenkos Conjecture

  • T. kövari et al.

    On a problem of K. Zarankiewicz

    Colloq. Math.

    (1954)
  • J.X. Li et al.

    On the logarithmic calculus and Sidorenkos conjecture

    Combinatorica.

    (2017)
  • Cited by (0)

    View full text