How far can edge transitivity in hypergraphs be? (original) (raw)

V Jornadas De Matematica Discreta Y Algoritmica 2006 Isbn 978 84 8448 380 9 Pags 393 400, 2006

Abstract

A hypergraph is s-edge transitive if its automorphism group acts transitively on the set of its s-edges. In this work, we study s-edge transitive hypergraphs and prove that if a hypergraph has degree at least three and all edges of size at least three, then s≤ 5. Besides, given an s-edge transitive hypergraph, we prove that there are infinitely many s-edge transitive hypergraphs that cover the given one.

Sonia Mansilla hasn't uploaded this paper.

Create a free Academia account to let Sonia Mansilla know you want this paper to be uploaded.

Ask for this paper to be uploaded.