A proof of the Elliott-Rödl conjecture on hypertrees in Steiner triple systems

preprint2022arXivOpen access

Abstract

Hypertrees are linear hypergraphs where every two vertices are connected by a unique path. Elliott and Rödl conjectured that for any given μ>0μ>0, there exists n0n_0 such that the following holds. Every nn-vertex Steiner triple system contains all hypertrees with at most (1−μ)n(1-μ)n vertices whenever n≥n0n\geq n_0. We prove this conjecture.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.