Weakly norming graphs are edge-transitive (Q2226630): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 04:11, 2 February 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
