Nilpotent 1-factorizations of the complete graph

DOI10.1002/jcd.20069zbMath1076.05044OpenAlexW2025572443WikidataQ114236291 ScholiaQ114236291MaRDI QIDQ5711783

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

startersharply transitive permutation group

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)

Related Items (13)

One-factorisations of complete graphs arising from ovals in finite planes ⋮ On the existence spectrum for sharply transitive \(G\)-designs, \(G\) a \([k\)-matching] ⋮ Unnamed Item ⋮ Vertex‐regular 1‐factorizations in infinite graphs ⋮ Quaternionic 1-factorizations and complete sets of rainbow spanning trees ⋮ Rainbow spanning tree decompositions in complete graphs colored by cyclic 1-factorizations ⋮ One-factorisations of complete graphs arising from hyperbolae in the Desarguesian affine plane ⋮ Cyclic uniform 2-factorizations of the complete multipartite graph ⋮ Symmetric 1-factorizations of the complete graph ⋮ \(k\)-pyramidal one-factorizations ⋮ On circular--linear one-factorizations of the complete graph ⋮ On sharply vertex transitive 2-factorizations of the complete graph ⋮ One–factorizations of complete graphs with regular automorphism groups

Cites Work

• Cyclic one-factorization of the complete graph
• Endliche Gruppen I
• Unnamed Item
• Unnamed Item
• Unnamed Item

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