On minimal defining sets of full designs and self-complementary designs, and a new algorithm for finding defining sets of \(t\)-designs

DOI10.1007/s00373-010-0892-2zbMath1231.05023OpenAlexW1970779578MaRDI QIDQ604662

Emine Şule Yazıcı, Emre Kolotoğlu

Publication date: 12 November 2010

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-010-0892-2

zbMATH Keywords

defining set algorithmextension of designsfull designsrestriction of designsself-complementary designsspectrum of minimal defining sets

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05)

Related Items (7)

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 ⋮ Defining sets of full designs with block size three. II ⋮ On the spectrum of minimal defining sets of full designs ⋮ On defining sets of full designs with block size three ⋮ On defining sets of full designs

Uses Software

• nauty

Cites Work

• On the structure of (v,k,t) trades
• On the spectrum of minimal defining sets of full designs
• An infinite class of 5-designs
• On the minimum number of blocks defining a design
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On minimal defining sets of full designs and self-complementary designs, and a new algorithm for finding defining sets of \(t\)-designs