Nilpotent 1-factorizations of the complete graph

DOI10.1002/JCD.20069MaRDI QIDQ5711783zbMATH OpenOpenAlexWikidataFDO

Authors Gloria Rinaldi

Publication date 8 December 2005

Published in Journal of Combinatorial Designs (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/jcd.20069

zbMATH Keywords

sharply transitive permutation groupstarter

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Sharply transitive 1‐factorizations of the complete graph with an invariant 1‐factor
• scientific article; zbMATH DE number 617560
• Abelian 1-factorizations of the complete graph
• The structure of the symmetry groups of perfect 1-factorizations of \(K_ 2n\)
• Symmetric 1-factorizations of the complete graph

Cites work

• Cyclic one-factorization of the complete graph
• Endliche Gruppen I
• scientific article; zbMATH DE number 3520420 (Why is no real title available?)
• scientific article; zbMATH DE number 979131 (Why is no real title available?)
• Starters: doubling constructions

Cited in

(19)

• One-factorisations of complete graphs arising from ovals in finite planes
• Rainbow spanning tree decompositions in complete graphs colored by cyclic 1-factorizations
• Cyclic uniform 2-factorizations of the complete multipartite graph
• On circular--linear one-factorizations of the complete graph
• Frattini-based starters in 2-groups
• Unextendible product bases and 1-factorization of complete graphs
• On sharply vertex transitive 2-factorizations of the complete graph
• Quaternionic 1-factorizations and complete sets of rainbow spanning trees
• One–factorizations of complete graphs with regular automorphism groups
• On the existence spectrum for sharply transitive \(G\)-designs, \(G\) a \([k]\)-matching
• Sharply transitive 1‐factorizations of the complete graph with an invariant 1‐factor
• Nilpotent Graph
• Regular 1-factorizations of complete graphs and decompositions into pairwise isomorphic rainbow spanning trees
• Abelian 1-factorizations of the complete graph
• Vertex‐regular 1‐factorizations in infinite graphs
• One-factorisations of complete graphs arising from hyperbolae in the Desarguesian affine plane
• Abelian 1-factorizations in infinite graphs
• Symmetric 1-factorizations of the complete graph
• k-pyramidal one-factorizations

This page was built for publication: Nilpotent 1-factorizations of the complete graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5711783)