Back to Search
Start Over
Embedding Hypertrees into Steiner Triple Systems
- Publication Year :
- 2018
-
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 \geq (1+\mu)n$? We show the answer is positive for a class of hypertrees and conjecture that the answer is always positive.<br />Comment: 23 pages, 6 figures
- Subjects :
- Mathematics - Combinatorics
Subjects
Details
- Database :
- arXiv
- Publication Type :
- Report
- Accession number :
- edsarx.1804.08191
- Document Type :
- Working Paper
- Full Text :
- https://doi.org/10.1002/jcd.21641