Let ℋ be the class of bounded measurable symmetric functions on [0, 1]2. For a function h ∈ ℋ and a graph G with vertex set [v1,⌦,vn} and edge set E(G), define
Answering a question raised by Conlon and Lee, we prove that in order for tG(∣h∣)1/∣E(G)∣ to be a norm on ℋ, the graph G must be edge-transitive.
This is a preview of subscription content, log in to check access.
Buy single article
Instant access to the full article PDF.
Price includes VAT for USA
Subscribe to journal
Immediate online access to all issues from 2019. Subscription will auto renew annually.
This is the net price. Taxes to be calculated in checkout.
D. Conlon and J. Lee: Finite reflection groups and graph norms, Adv. Math.315 (2017), 130–165.
F. Garbe, J. Hladký and J. Lee: Two remarks on graph norms, arXiv:1909.10987, 2019.
H. Hatami: Graph norms and Sidorenko’s conjecture, Israel J. Math.175 (2010), 125–150.
D. Král’, T. Martins, P. P. Pach and M. Wrochna: The step Sidorenko property and nonnorming edge-transitive graphs, J. Combin. Theory Ser. A162 (2019), 34–54.
J. Lee and B. Schülke: Convex graphon parameters and graph norms, Israel J. Math. (to appear), arXiv:1910.08454, 2019.
L. Lovász: Large networks and graph limits, volume 60 of Colloquium Publications, Amer. Math. Soc., 2012.
I would like to thank Joonkyung Lee for helpful discussions, and the three anonymous referees for their careful reading of the article and valuable suggestions.
About this article
Cite this article
Sidorenko, A. Weakly Norming Graphs are Edge-Transitive. Combinatorica 40, 601–604 (2020). https://doi.org/10.1007/s00493-020-4468-3
Mathematics Subject Classification (2010)