Embedding partial Steiner triple systems with few triples

Abstract

It was proved in 2009 that any partial Steiner triple system of order u has an embedding of order v for each admissible integer v≥ 2u+1. This result is best-possible in the sense that, for each u≥ 9, there exists a partial Steiner triple system of order u that does not have an embedding of order v for any v<2u+1. Many partial Steiner triple systems do have embeddings of orders smaller than 2u+1, but little has been proved about when these embeddings exist. In this paper we construct embeddings of orders less than 2u+1 for partial Steiner triple systems with few triples. In particular, we show that a partial Steiner triple system of order u ≥ 62 with at most u250-11u100-11675 triples has an embedding of order v for each admissible integer v ≥ 8u+175.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…