English

Embedding partial Steiner triple systems with few triples

Combinatorics 2014-02-13 v1

Abstract

It was proved in 2009 that any partial Steiner triple system of order uu has an embedding of order vv for each admissible integer v2u+1v\geq 2u+1. This result is best-possible in the sense that, for each u9u\geq 9, there exists a partial Steiner triple system of order uu that does not have an embedding of order vv for any v<2u+1v<2u+1. Many partial Steiner triple systems do have embeddings of orders smaller than 2u+12u+1, but little has been proved about when these embeddings exist. In this paper we construct embeddings of orders less than 2u+12u+1 for partial Steiner triple systems with few triples. In particular, we show that a partial Steiner triple system of order u62u \geq 62 with at most u25011u10011675\frac{u^2}{50}-\frac{11u}{100}-\frac{116}{75} triples has an embedding of order vv for each admissible integer v8u+175v \geq \frac{8u+17}{5}.

Cite

@article{arxiv.1402.2739,
  title  = {Embedding partial Steiner triple systems with few triples},
  author = {Daniel Horsley},
  journal= {arXiv preprint arXiv:1402.2739},
  year   = {2014}
}

Comments

20 pages, 0 figures

R2 v1 2026-06-22T03:06:25.756Z