Weakly norming graphs are edge-transitive (Q2226630)

From MaRDI portal
Revision as of 21:57, 1 August 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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

    Identifiers