Steiner pentagon systems

DOI10.1016/0012-365X(84)90104-3zbMATH Open0549.05010OpenAlexW1983810685MaRDI QIDQ800362FDOQ800362

Authors: C. C. Lindner, D. R. Stinson 

Publication date: 1984

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

Full work available at URL: https://doi.org/10.1016/0012-365x(84)90104-3

Recommendations

• Holey Steiner pentagon systems
• Super-simple Steiner pentagon systems
• Steiner pentagon covering designs
• Holey Steiner pentagon systems and related designs
• scientific article; zbMATH DE number 21733
• Super-simple twofold Steiner pentagon systems
• scientific article; zbMATH DE number 874486
• Extra two-fold Steiner pentagon systems
• The Steiner cycle polytope

zbMATH Keywords

Steiner pentagon systemperpendicular arraysself-orthogonal latin squares

Mathematics Subject Classification ID

Orthogonal arrays, Latin squares, Room squares (05B15) Graph theory (05C99)

Cites Work

• Balanced incomplete block designs and related designs
• Title not available (Why is that?)
• On the cyclic decompositions of the complete graph into polygons with odd number of edges
• Title not available (Why is that?)
• On the spectrum of resolvable orthogonal arrays invariant under the Klein group \(K_ 4\)
• Title not available (Why is that?)

Cited In (40)

• Title not available (Why is that?)
• On perfect Γ-decompositions of the complete graph
• Holey Steiner pentagon systems and related designs
• Existence of three HMOLS of type \(2^nu^{1}\)
• Steiner pentagon covering designs
• The spectrum of \(\text{HSOLSSOM}(h^ n)\) where \(h\) is even
• Constructions of perfect Mendelsohn designs
• The spectrum for 2-perfect 6-cycle systems
• The spectrum for lambda-fold 2-perfect 6-cycle systems
• Super-simple Steiner pentagon systems
• Existence of three HMOLS of types \(h^ n\) and \(2^ n3^ 1\)
• On the existence of elementary Abelian cycle systems
• Title not available (Why is that?)
• Holey self-orthogonal Latin squares with symmetric orthogonal mates
• Super-simple twofold Steiner pentagon systems
• Decompositions of edge-colored complete graphs
• Title not available (Why is that?)
• The combinatorics of authentication and secrecy codes
• Existence of HSOLSSOMs of type \(2^nu^1\)
• Title not available (Why is that?)
• Neighbor designs and m-wheel systems
• Existence of APAV\((q,k)\) with \(q\) a prime power \(\equiv 5 \pmod 8\) and \(k\equiv 1 \pmod 4\).
• Holey Steiner pentagon systems
• Small embeddings for partial cycle systems of odd length
• A construction for authentication/secrecy codes from 3-homogeneous permutation groups
• \(2\)-perfect \(m\)-cycle systems can be equationally defined for \(m=3\), \(5\), and \(7\) only
• Some new HSOLSSOMs of types \(h^n\) and \(1^mu^1\)
• A construction for authentication/secrecy codes from certain combinatorial designs
• On the existence of MOLS with equal-sized holes
• Varieties of quasigroups arising from 2-perfect \(m\)-cycle systems
• Some constructions for cyclic perfect cycle systems
• \(i\)-perfect \(m\)-cycle systems, \(m\leq 19\)
• On sets of three mols with holes
• Extra two-fold Steiner pentagon systems
• On complementary decompositions of the complete graph
• Combinatorial designs and related computational constructions
• Almost 2-perfect 6-cycle systems
• Enumeration of small nonisomorphic pentagonal packings
• 2-perfect \(m\)-cycle systems
• Nesting and almost resolvability of pentagon systems

This page was built for publication: Steiner pentagon systems

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