论文信息 - Nilpotent 1‐factorizations of the complete graph

Nilpotent 1‐factorizations of the complete graph

For which groups G of even order 2n does a 1-factorization of the complete graph K2n exist with the property of admitting G as a sharply vertex-transitive automorphism group? The complete answer is still unknown. Using the definition of a starter in G introduced in 4, we give a positive answer for new classes of groups; for example, the nilpotent groups with either an abelian Sylow 2-subgroup or a non-abelian Sylow 2-subgroup which possesses a cyclic subgroup of index 2. Further considerations are given in case the automorphism group G fixes a 1-factor. © 2005 Wiley Periodicals, Inc. J Combin Designs

Gloria Rinaldi | G. Rinaldi

[1] Domenico Labbate,et al. One‐factorizations of complete graphs with vertex‐regular automorphism groups , 2002 .

[2] Gábor Korchmáros,et al. Sharply transitive 1‐factorizations of the complete graph with an invariant 1‐factor , 1994 .

[3] B. Huppert. Endliche Gruppen I , 1967 .

[4] Edwin C. Ihrig,et al. Symmetry groups related to the construction of perfect one factorizations of K2n , 1986, J. Comb. Theory, Ser. B.

[5] Gloria Rinaldi,et al. Quaternionic Starters , 2005, Graphs Comb..

[6] Douglas R. Stinson,et al. Some new perfect one-factorizations from starters in finite fields , 1989, J. Graph Theory.

[7] Marco Buratti,et al. Abelian 1-Factorizations of the Complete Graph , 2001, Eur. J. Comb..

[8] Alan Hartman,et al. Cyclic One-Factorization of the Complete Graph , 1985, Eur. J. Comb..

[9] P. Cameron. Parallelisms Of Complete Designs , 1976 .

[10] The Structure of Symmetry Groups of Almost Perfect One Factorizations , 2000 .

[11] Edwin C. Ihrig,et al. The structure of the symmetry groups of perfect 1-factorizations of K2n , 1989, J. Comb. Theory, Ser. B.

[12] C. Colbourn,et al. The CRC handbook of combinatorial designs , edited by Charles J. Colbourn and Jeffrey H. Dinitz. Pp. 784. $89.95. 1996. ISBN 0-8493-8948-8 (CRC). , 1997, The Mathematical Gazette.