Some approaches for solving the general (t,k)-design existence problem and other related problems

https://doi.org/10.1016/j.dam.2012.03.011Get rights and content
Under an Elsevier user license
open archive

Abstract

In this short survey, some approaches that can be used to solve the generalized (t,k)-design problem are considered. Special cases of the generalized (t,k)-design problem include well-known conjectures for t-designs, degree sequences of graphs and hypergraphs, and partial Steiner systems. Also described are some related problems such as the characterization of f-vectors of pure simplicial complexes, which are well known but little understood. Some suggestions how enumerative and polyhedral techniques may help are also described.

Keywords

Designs
Graphs
Hypergraphs
Tags

Cited by (0)