Cliques in Steiner systems
Open Access
- 8 January 2009
- journal article
- Published by Walter de Gruyter GmbH in Mathematica Slovaca
- Vol. 59 (1) , 109-120
Abstract
A partial Steiner (k,l)-system is a k-uniform hypergraph with the property that every l-element subset of V is contained in at most one edge of . In this paper we show that for given k,l and t there exists a partial Steiner (k,l)-system such that whenever an l-element subset from every edge is chosen, the resulting l-uniform hypergraph contains a clique of size t. As the main result of this note, we establish asymptotic lower and upper bounds on the size of such cliques with respect to the order of Steiner systems.Keywords
This publication has 6 references indexed in Scilit:
- More-Than-Nearly-Perfect Packings and Partial DesignsCombinatorica, 1999
- Nearly perfect matchings in regular simple hypergraphsIsrael Journal of Mathematics, 1997
- The minimum independence number for designsCombinatorica, 1995
- Strong Ramsey theorems for Steiner systemsTransactions of the American Mathematical Society, 1987
- Coloring Steiner Triple SystemsSIAM Journal on Algebraic Discrete Methods, 1982
- On a Problem of Formal LogicProceedings of the London Mathematical Society, 1930