Weakly norming graphs are edge-transitive (Q2226630)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7307769
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Weakly norming graphs are edge-transitive |
scientific article; zbMATH DE number 7307769 |
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
0.7718479037284851
0 references
0.7604346871376038
0 references
0.7574180960655212
0 references
0.7178660035133362
0 references
