Covering triples by quadruples: an asymptotic solution (Q1072560): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/0097-3165(86)90119-6 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1999217025 / rank | |||
Normal rank |
Revision as of 03:46, 20 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Covering triples by quadruples: an asymptotic solution |
scientific article |
Statements
Covering triples by quadruples: an asymptotic solution (English)
0 references
1986
0 references
\textit{J. Schoenheim} [Pac. J. Math. 14, 1405--1411 (1964; Zbl 0128.24501)] showed that to cover all triples of an \(n\)-set by quadruples, at least \(\lceil \frac{1}{4}n\lceil \frac{1}{3}(n-1)\lceil \frac{1}{2}(n-2)\rceil \rceil \rceil\) quadruples are needed with equality e.g. when a Steiner quadruple system on n points exists. Using a construction of Mills for \(n=499\) and some recursive techniques it is shown that this number of quadruples suffices for all \(n\geq 52423\).
0 references
Steiner quadruple system
0 references