A construction of almost Steiner systems
From MaRDI portal
Publication:2935201
DOI10.1002/JCD.21380zbMATH Open1307.05022arXiv1303.4065OpenAlexW1524753800MaRDI QIDQ2935201FDOQ2935201
Asaf Ferber, Michael Krivelevich, Rani Hod, Benny Sudakov
Publication date: 22 December 2014
Published in: Journal of Combinatorial Designs (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/1303.4065
Recommendations
Combinatorial aspects of block designs (05B05) Steiner systems in finite geometry (51E10) Triple systems (05B07)
Cites Work
Cited In (7)
- Title not available (Why is that?)
- Supersaturation of \(C_4\): from Zarankiewicz towards Erdős-Simonovits-Sidorenko
- The Existence of Designs via Iterative Absorption: Hypergraph 𝐹-designs for Arbitrary 𝐹
- Title not available (Why is that?)
- On an infinite class of Steiner systems constructed from affine spaces
- Title not available (Why is that?)
- 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)