Isomorph-Free Exhaustive Generation of Designs with Prescribed Groups of Automorphisms

DOI10.1137/S0895480104444788zbMath1093.05010MaRDI QIDQ5470786

Petteri Kaski

Publication date: 1 June 2006

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

zbMATH Keywords

Steiner triple systemsymmetry reductionclassification algorithmcombinatorial searchconsistency checkingKramer-Mesner methodisomorph rejectionisomorph-free generation

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Steiner systems in finite geometry (51E10) Triple systems (05B07)

Related Items (8)

The number of Latin squares of order 11 ⋮ Enumerating Steiner triple systems ⋮ Steiner triple systems of order 21 with subsystems ⋮ The order of the automorphism group of a binary \(q\)-analog of the Fano plane is at most two ⋮ Sparse Steiner triple systems of order 21 ⋮ There are 1,132,835,421,602,062,347 nonisomorphic one-factorizations ofK₁₄ ⋮ Kirkman triple systems with subsystems ⋮ Counting Hamiltonian cycles in bipartite graphs

Uses Software

• GAP

This page was built for publication: Isomorph-Free Exhaustive Generation of Designs with Prescribed Groups of Automorphisms