The automorphism group of a product of hypergraphs
✍ Scribed by Geňa Hahn
- Publisher
- Elsevier Science
- Year
- 1981
- Tongue
- English
- Weight
- 315 KB
- Volume
- 30
- Category
- Article
- ISSN
- 0095-8956
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
## Abstract We show that every simple, (weakly) connected, possibly directed and infinite, hypergraph has a unique prime factor decomposition with respect to the (weak) Cartesian product, even if it has infinitely many factors. This generalizes previous results for graphs and undirected hypergraphs
## Abstract In this article we study the product action of the direct product of automorphism groups of graphs. We generalize the results of Watkins [J. Combin Theory 11 (1971), 95–104], Nowitz and Watkins [Monatsh. Math. 76 (1972), 168–171] and W. Imrich [Israel J. Math. 11 (1972), 258–264], and w
If n G 3 and F is free of rank n, then Out Aut F s Out Out F s 1 . n n n ᮊ 2000 Academic Press n is an isomorphism. Tits's theorem leads to a proof that the outer automor-
8% show that for my group If (Bnhc of infhitee) there exists an indepmdence structure with autans~~qMsm gruep i.wmcwphic ts ff. The pmof is by construction and shows that 5 1 Introduction We show &at for any graup N f'finite CH infinite) there exists an independence structure with autamorphism grou