On defining sets of full designs
From MaRDI portal
Publication:710602
DOI10.1016/J.DISC.2010.07.010zbMATH Open1241.05007OpenAlexW2065461661MaRDI QIDQ710602FDOQ710602
Authors: James 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
Recommendations
Cites Work
- Defining sets of full designs with block size three. II
- Minimal defining sets for full \(2\)-\((v,3,v-2)\) designs
- On minimal defining sets of full designs and self-complementary designs, and a new algorithm for finding defining sets of \(t\)-designs
- On the minimum number of blocks defining a design
- On orthogonal double covers of graphs
- Title not available (Why is that?)
- Edge partitions of the complete symmetric directed graph and related designs
- The spectrum of minimal defining sets of some Steiner systems
- Constructing defining sets of full designs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On defining sets of full designs and of designs related to them
Cited In (10)
- A method for constructing defining sets of all \((v,k,\lambda)\) designs
- Critical sets of full \(n\)-Latin squares
- Title not available (Why is that?)
- On minimal defining sets of full designs and self-complementary designs, and a new algorithm for finding defining sets of \(t\)-designs
- Constructing defining sets of full designs
- On defining sets of full designs and of designs related to them
- On defining sets of full designs with block size three
- Critical sets of 2-balanced Latin rectangles
- Minimal defining sets for full \(2\)-\((v,3,v-2)\) designs
- Lower bounds on the sizes of defining sets in full \(n\)-Latin squares and full designs
This page was built for publication: On defining sets of full designs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q710602)
