Reiher–Schacht conjecture on constant rooted clique densities

Let r3r\ge 3 and let WW be a graphon. For x,y[0,1]x,y\in[0,1], write tx,y(Kr,W)t_{x,y}(K_r^{\bullet\bullet},W) for the rooted homomorphism density of the clique KrK_r with two distinguished roots, and let VW(r)(x,y)=tx,y(Kr,W)V_W^{(r)}(x,y)=t_{x,y}(K_r^{\bullet\bullet},W). Suppose that

VW(r)dV_W^{(r)}\equiv d

for some d[0,1]d\in[0,1]. Reiher–Schacht conjecture. Then WW is KrK_r-free when d=0d=0, or

Wd1/(r2).W\equiv d^{1/{\binom r 2}}.

This characterizes graphons whose rooted KrK_r-density graphon is constant: apart from the KrK_r-free case, the graphon should be constant. The conjecture is posed for r3r\ge 3 and is attributed in the source to concluding remarks of Reiher and Schacht; no resolution is given here.

Sources & referencesView supporting material

Primary source

Jan Hladky, Christos Pelekis and Matas Sileikis, “A limit theorem for small cliques in inhomogeneous random graphs”, arXiv:1903.10570 (2021).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.