Representing groups by graphs with constant link and hypergraphs

Link:

https://doi.org/10.1002/jgt.3190100406

Autor/in:

Vogler, Walter

Erscheinungsjahr:

1986

Medientyp:

Text

Schlagworte:

Article
Article

Beschreibung:

A graph L is called a link graph if there is a graph G such that for each vertex of G its neighbors induce a subgraph isomorphic to L. Such a G is said to have constant link L. We prove that for any finite group Γ and any disconnected link graph L with at least three vertices there are infinitely many connected graphs G with constant link L and AutG ⋍ Γ. We look at the analogous problem for connected link graphs, namely, link graphs that are paths or have disconnected complements. Furthermore we prove that for n, r ≥ 2, but not n = 2 = r, any finite group can be represented by infinitely many connected r‐uniform, n‐regular hypergraphs of arbitrarily large girth. Copyright © 1986 Wiley Periodicals, Inc., A Wiley Company

Lizenz:

info:eu-repo/semantics/closedAccess

Quellsystem:

Forschungsinformationssystem der UHH

Interne Metadaten

Quelldatensatz: oai:www.edit.fis.uni-hamburg.de:publications/96b34c50-a223-4aa0-b8ba-7c54f6973908