English

Codegree conditions for (fractional) Steiner triple systems

Combinatorics 2026-02-13 v2

Abstract

We establish an upper bound on the minimum codegree necessary for the existence of spanning, fractional Steiner triple systems in 33-uniform hypergraphs. This improves upon a result by Lee in 2023. In particular, together with results from Lee's paper, our results imply that if nn is sufficiently large and satisfies some necessary divisibility conditions, then a 33-uniform, nn-vertex hypergraph HH contains a Steiner triple system if every pair of vertices forms an edge in HH with at least 0.8579n0.8579n other vertices.

Keywords

Cite

@article{arxiv.2411.07981,
  title  = {Codegree conditions for (fractional) Steiner triple systems},
  author = {Michael Zheng},
  journal= {arXiv preprint arXiv:2411.07981},
  year   = {2026}
}

Comments

Revised version accepted for publication to SIDMA

R2 v1 2026-06-28T19:57:23.654Z