Weakly norming graphs are edge-transitive (Q2226630): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W3102122029 / rank | |||
Normal rank | |||
| Property / arXiv ID | |||
| Property / arXiv ID: 2003.13598 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Finite reflection groups and graph norms / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Graph norms and Sidorenko's conjecture / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The step Sidorenko property and non-norming edge-transitive graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Convex graphon parameters and graph norms / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4899293 / rank | |||
Normal rank | |||
Latest revision as of 12:40, 24 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Weakly norming graphs are edge-transitive |
scientific article |
Statements
Weakly norming graphs are edge-transitive (English)
0 references
8 February 2021
0 references
The author answers the question raised by \textit{D. Conlon} and \textit{J. Lee} [Adv. Math. 315, 130--165 (2017; Zbl 1366.05107)] concerning norming and weakly norming graphs. It is proved that every weakly norming graph is edge-transitive.
0 references
norming graph
0 references
weakly norming graph
0 references
edge-transitive graph
0 references
