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-2zbMATH Open1231.05023OpenAlexW1970779578MaRDI QIDQ604662FDOQ604662

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

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

Recommendations

• scientific article; zbMATH DE number 553903
• 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
• Minimal defining sets for full \(2\)-\((v,3,v-2)\) designs

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)

Cites Work

• Title not available (Why is that?)
• Minimal defining sets for full \(2\)-\((v,3,v-2)\) designs
• Title not available (Why is that?)
• On the minimum number of blocks defining a design
• On the spectrum of minimal defining sets of full designs
• An infinite class of 5-designs
• On the structure of (v,k,t) trades
• Smallest defining sets of some STS(19)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (9)

• On the spectrum of minimal defining sets of full designs
• Critical sets of full \(n\)-Latin squares
• Title not available (Why is that?)
• On defining sets of full designs
• On defining sets of full designs with block size three
• Critical sets of 2-balanced Latin rectangles
• Defining sets of full designs with block size three. II
• Title not available (Why is that?)
• Lower bounds on the sizes of defining sets in full \(n\)-Latin squares and full designs

Uses Software

• nauty

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

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