English

Graph-theoretic perspective on a special class of Steiner Systems

Combinatorics 2014-10-24 v2

Abstract

We study S(t1,t,2t)S(t-1,t,2t), which is a special class of Steiner systems. Explicit constructions for designing such systems are developed under a graph-theoretic platform where Steiner systems are represented in the form of uniform hypergraphs. The constructions devised are then used to study the 22-coloring properties of these uniform hypergraphs.

Keywords

Cite

@article{arxiv.1410.5855,
  title  = {Graph-theoretic perspective on a special class of Steiner Systems},
  author = {Jithin Mathews},
  journal= {arXiv preprint arXiv:1410.5855},
  year   = {2014}
}
R2 v1 2026-06-22T06:31:57.371Z