arXiv:2003.13598 [math.CO]AbstractReferencesReviewsResources
Weakly norming graphs are edge-transitive
Published 2020-03-30Version 1
Let $\mathcal{H}$ be the class of bounded measurable symmetric functions on $[0,1]^2$. For a function $h \in \mathcal{H}$ and a graph $G$ with vertex set $\{v_1,\ldots,v_n\}$ and edge set $E(G)$, define \[ t_G(h) \; = \; \int \cdots \int \prod_{\{v_i,v_j\} \in E(G)} h(x_i,x_j) \: dx_1 \cdots dx_n \: . \] We prove that if $t_G(|h|)^{1/|E(G)|}$ is a norm on $\mathcal{H}$, then $G$ is edge-transitive.
Comments: 4 pages
Categories: math.CO
Related articles: Most relevant | Search more
arXiv:math/9409214 [math.CO] (Published 1994-09-16)
Invertible families of sets of bounded degree
arXiv:1809.09302 [math.CO] (Published 2018-09-25)
Partitioning The Edge Set of a Hypergraph Into Almost Regular Cycles
arXiv:1503.02885 [math.CO] (Published 2015-03-10)
A remark on the Tournament game