Embedding Hypertrees into Steiner Triple Systems
Abstract
In this paper we are interested in the following question: Given an arbitrary Steiner triple system S on m vertices and any 3-uniform hypertree T on n vertices, is it necessary that S contains T as a subgraph provided m ≥ (1+μ)n? We show the answer is positive for a class of hypertrees and conjecture that the answer is always positive.
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.