On the existence spectrum for sharply transitive \(G\)-designs, \(G\) a \([k]\)-matching

DOI10.1016/J.DISC.2014.05.021zbMath1298.05262OpenAlexW1981578886MaRDI QIDQ400365

Arrigo Bonisoli, Simona Bonvicini

Publication date: 21 August 2014

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2014.05.021

zbMATH Keywords

matching\(G\)-designdecomposition of a graphsharply transitive permutation group

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (1)

Constructions of dihedral Steiner quadruple systems

Uses Software

• GAP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On 2-pyramidal Hamiltonian cycle systems
• Cyclic and dihedral 1-factorizations of multipartite graphs
• Symmetric 1-factorizations of the complete graph
• Cyclic one-factorization of the complete graph
• Frattini-based starters in 2-groups
• One-factorizations of complete graphs with vertex-regular automorphism groups
• A survey on the existence ofG-Designs
• Sharply transitive 1‐factorizations of the complete graph with an invariant 1‐factor
• Dihedral Hamiltonian Cycle Systems of the Cocktail Party Graph
• 1‐rotational k‐factorizations of the complete graph and new solutions to the Oberwolfach problem
• Nilpotent 1-factorizations of the complete graph
• Abelian 1-factorizations of the complete graph

This page was built for publication: On the existence spectrum for sharply transitive \(G\)-designs, \(G\) a \([k]\)-matching