On defining sets of full designs

DOI10.1016/j.disc.2010.07.010zbMath1241.05007OpenAlexW2065461661MaRDI QIDQ710602

James G. Lefevre, Mary Waterhouse

Publication date: 19 October 2010

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

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

zbMATH Keywords

full designsdefining setspairwise balance design

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05)

Related Items

Critical sets of full \(n\)-Latin squares, Critical sets of 2-balanced Latin rectangles, Lower bounds on the sizes of defining sets in full \(n\)-Latin squares and full designs

Cites Work

• On minimal defining sets of full designs and self-complementary designs, and a new algorithm for finding defining sets of \(t\)-designs
• Edge partitions of the complete symmetric directed graph and related designs
• The spectrum of minimal defining sets of some Steiner systems
• Defining sets of full designs with block size three. II
• On the minimum number of blocks defining a design
• On orthogonal double covers of graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item