Large sets of disjoint packings on \(6k+5\) points (Q703680)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Large sets of disjoint packings on 6k+5 points |
scientific article; zbMATH DE number 2126382
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Large sets of disjoint packings on \(6k+5\) points |
scientific article; zbMATH DE number 2126382 |
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
0 references
0 references
0 references
0.8042608499526978
0 references
0.7818626165390015
0 references
0.7677897214889526
0 references
0.7669923901557922
0 references
