A construction of almost Steiner systems

From MaRDI portal
Publication:2935201




Abstract: Let n, k, and t be integers satisfying n>k>tge2. A Steiner system with parameters t, k, and n is a k-uniform hypergraph on n vertices in which every set of t distinct vertices is contained in exactly one edge. An outstanding problem in Design Theory is to determine whether a nontrivial Steiner system exists for tgeq6. In this note we prove that for every k>tge2 and sufficiently large n, there exists an almost Steiner system with parameters t, k, and n; that is, there exists a k-uniform hypergraph on n vertices such that every set of t distinct vertices is covered by either one or two edges.









This page was built for publication: A construction of almost Steiner systems

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