Large sets of disjoint packings on \(6k+5\) points (Q703680): Difference between revisions
From MaRDI portal
Removed claims |
Changed an Item |
||
| Property / author | |||
| Property / author: Haitao Cao / rank | |||
Normal rank | |||
| Property / author | |||
| Property / author: Lie Zhu / rank | |||
Normal rank | |||
| Property / reviewed by | |||
| Property / reviewed by: Ralph G.Stanton / rank | |||
Normal rank | |||
Revision as of 08:30, 12 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Large sets of disjoint packings on \(6k+5\) points |
scientific article |
Statements
Large sets of disjoint packings on \(6k+5\) points (English)
0 references
11 January 2005
0 references
\textit{P. J. Schellenberg} and \textit{D. R. Stinson} [J. Comb. Math. Comb. Comput. 5, 143--160 (1989; Zbl 0674.94008)] introduced this large set problem and used it to construct perfect threshold schemes. The authors show that a large set of maximal packings on \(6k+5\) points exists for every \(k\) (that is, a set of \(6k+1\) disjoint packings, all of which omit a cycle of length four).
0 references
combinatorics
0 references
packing
0 references
large set
0 references
perfect threshold scheme
0 references
partitionable candelabra system
0 references
\(t\)-wise balanced design
0 references
