Convex graphon parameters and graph norms

Sidorenko's conjecture states that the number of copies of a bipartite graph \(H\) in a graph \(G\) is asymptotically minimised when \(G\) is a quasirandom graph. A notorious example where this conjecture remains open is when \(H=K_{5,5}\setminus C_{10}\). It was even unknown whether this graph...

Full description

Saved in:
Bibliographic Details
Published inarXiv.org
Main Authors Lee, Joonkyung, Schülke, Bjarne
Format Paper
LanguageEnglish
Published Ithaca Cornell University Library, arXiv.org 16.01.2020
Subjects
Convexity
Graph theory
Hessian matrices
Homomorphisms
Norms
Online AccessGet full text

Cover

More Information
Summary:Sidorenko's conjecture states that the number of copies of a bipartite graph \(H\) in a graph \(G\) is asymptotically minimised when \(G\) is a quasirandom graph. A notorious example where this conjecture remains open is when \(H=K_{5,5}\setminus C_{10}\). It was even unknown whether this graph possesses the strictly stronger, weakly norming property. We take a step towards understanding the graph \(K_{5,5}\setminus C_{10}\) by proving that it is not weakly norming. More generally, we show that 'twisted' blow-ups of cycles, which include \(K_{5,5}\setminus C_{10}\) and \(C_6\square K_2\), are not weakly norming. This answers two questions of Hatami. The method relies on the analysis of Hessian matrices defined by graph homomorphisms, by using the equivalence between the (weakly) norming property and convexity of graph homomorphism densities. We also prove that \(K_{t,t}\) minus a perfect matching, proven to be weakly norming by Lovász, is not norming for every \(t>3\).
ISSN:2331-8422