2000 character limit reached
Codegree conditions for (fractional) Steiner triple systems (2411.07981v1)
Published 12 Nov 2024 in math.CO
Abstract: We establish an upper bound on the minimum codegree necessary for the existence of spanning, fractional Steiner triple systems in $3$-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 $n$ is sufficiently large and satisfies some necessary divisibility conditions, then a $3$-uniform, $n$-vertex hypergraph $H$ contains a Steiner triple system if every pair of vertices forms an edge in $H$ with at least $0.8579n$ other vertices.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.