𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Doubly transitive 2-factorizations

✍ Scribed by Arrigo Bonisoli; Marco Buratti; Giuseppe Mazzuoccolo


Publisher
John Wiley and Sons
Year
2007
Tongue
English
Weight
142 KB
Volume
15
Category
Article
ISSN
1063-8539

No coin nor oath required. For personal study only.

✦ Synopsis


Abstract

Let $\cal F$ be a 2‐factorization of the complete graph K~v~ admitting an automorphism group G acting doubly transitively on the set of vertices. The vertex‐set V(K~v~) can then be identified with the point‐set of AG(n, p) and each 2‐factor of $\cal F$ is the union of p‐cycles which are obtained from a parallel class of lines of AG(n, p) in a suitable manner, the group G being a subgroup of A G L(n, p) in this case. The proof relies on the classification of 2‐(v, k, 1) designs admitting a doubly transitive automorphism group. The same conclusion holds even if G is only assumed to act doubly homogeneously. © 2006 Wiley Periodicals, Inc. J Combin Designs


📜 SIMILAR VOLUMES


Finite Doubly Transitive Affine Planes
✍ Vikram Jha; Norman L. Johnson 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 140 KB

In this article, we classify the finite affine planes admitting doubly transitive collineation groups.

Arc-transitive homogeneous factorization
✍ Tian Khoon Lim 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 140 KB

## Abstract We study arc‐transitive homogeneous factorizations of a complete graph on 81 vertices and give an almost complete description of all possible factors that arise. In particular, we show that there exists an arc‐transitive homogeneous factorization of __K__~81~ such that the factors are i

Locally 2-arc transitive graphs, homogen
✍ Michael Giudici; Cai Heng Li; Cheryl E. Praeger 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 134 KB

## Abstract We establish natural bijections between three different classes of combinatorial objects; namely certain families of locally 2‐arc transitive graphs, partial linear spaces, and homogeneous factorizations of arc‐transitive graphs. Moreover, the bijections intertwine the actions of the re

SGDs with doubly transitive automorphism
✍ Cameron, Peter J. 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 168 KB

Symmetric graph designs, or SGDs, were defined by Gronau et al. as a common generalization of symmetric BIBDs and orthogonal double covers. This note gives a classification of SGDs admitting a 2-transitive automorphism group. There are too many for a complete determination, but in some special cases