A construction of almost Steiner systems
From MaRDI portal
Publication:2935201
Abstract: Let , , and be integers satisfying . A Steiner system with parameters , , and is a -uniform hypergraph on vertices in which every set of distinct vertices is contained in exactly one edge. An outstanding problem in Design Theory is to determine whether a nontrivial Steiner system exists for . In this note we prove that for every and sufficiently large , there exists an almost Steiner system with parameters , , and ; that is, there exists a -uniform hypergraph on vertices such that every set of distinct vertices is covered by either one or two edges.
Recommendations
Cites work
Cited in
(7)- scientific article; zbMATH DE number 1234981 (Why is no real title available?)
- Supersaturation of C₄: from Zarankiewicz towards Erdős-Simonovits-Sidorenko
- The Existence of Designs via Iterative Absorption: Hypergraph 𝐹-designs for Arbitrary 𝐹
- On an infinite class of Steiner systems constructed from affine spaces
- scientific article; zbMATH DE number 179003 (Why is no real title available?)
- scientific article; zbMATH DE number 1974653 (Why is no real title available?)
- Steiner t-Designs for Large t
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)