Premium
Sharply transitive 1‐factorizations of the complete graph with an invariant 1‐factor
Author(s) -
Korchmáros Gábor
Publication year - 1994
Publication title -
journal of combinatorial designs
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.618
H-Index - 34
eISSN - 1520-6610
pISSN - 1063-8539
DOI - 10.1002/jcd.3180020403
Subject(s) - mathematics , combinatorics , transitive relation , vertex (graph theory) , factorization , automorphism group , invariant (physics) , automorphism , graph , discrete mathematics , algorithm , mathematical physics
Abstract We give some simple characterizations of those n for which K n has a sharply transitive 1‐factorization with an assigned automorphism group that acts sharply transitively on the vertex set and also fixes a 1‐factor. © 1994 John Wiley & Sons, Inc.