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 has an embedding of order for each admissible integer . This result is best-possible in the sense that, for each , there exists a partial Steiner triple system of order that does not have an embedding of order for any . Many partial Steiner triple systems do have embeddings of orders smaller than , but little has been proved about when these embeddings exist. In this paper we construct embeddings of orders less than for partial Steiner triple systems with few triples. In particular, we show that a partial Steiner triple system of order with at most triples has an embedding of order for each admissible integer .
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