Weakly norming graphs are edge-transitive
Combinatorics
2020-09-18 v2
Abstract
Let be the class of bounded measurable symmetric functions on . For a function and a graph with vertex set and edge set , define Answering a question raised by Conlon and Lee, we prove that in order for to be a norm on , the graph must be edge-transitive.
Keywords
Cite
@article{arxiv.2003.13598,
title = {Weakly norming graphs are edge-transitive},
author = {Alexander Sidorenko},
journal= {arXiv preprint arXiv:2003.13598},
year = {2020}
}
Comments
to appear in "Combinatorica"