Weakly norming graphs are edge-transitive

Abstract

Let H be the class of bounded measurable symmetric functions on [0,1]2. For a function h ∈ H and a graph G with vertex set \v1,…,vn\ and edge set E(G), define \[ tG(h) \; = \; ∫ ·s ∫ Π\vi,vj\ ∈ E(G) h(xi,xj) \: dx1 ·s dxn \: . \] Answering a question raised by Conlon and Lee, we prove that in order for tG(|h|)1/|E(G)| to be a norm on H, the graph G must be edge-transitive.

0

Discussion (0)

Sign in to join the discussion.

Loading comments…