• Corpus ID: 245877619

High-Girth Steiner Triple Systems

@inproceedings{Kwan2022HighGirthST,
  title={High-Girth Steiner Triple Systems},
  author={Matthew Kwan and Ashwin Sah and Mehtaab Sawhney and Michael Simkin},
  year={2022}
}
We prove a 1973 conjecture due to Erd\H{o}s on the existence of Steiner triple systems with arbitrarily high girth. 

Finding an almost perfect matching in a hypergraph avoiding forbidden submatchings

In 1973, Erd˝os conjectured the existence of high girth ( n, 3 , 2)-Steiner systems. Recently, Glock, K¨uhn, Lo, and Osthus and independently Bohman and Warnke proved the approximate version of

Ramsey numbers for multiple copies of sparse graphs

These methods rely on a beautiful classic proof of Graham, R¨odl, and Ruci´nski, with the emphasis on developing an eficantly stronger bounds on n in case H is a sparse graph, most notably of bounded maximum degree.

The limit in the $(k+2, k)$-Problem of Brown, Erd\H{o}s and S\'os exists for all $k\geq 2$

Let f ( r ) ( n ; s, k ) be the maximum number of edges of an r -uniform hypergraph on n vertices not containing a subgraph with k edges and at most s vertices. In 1973, Brown, Erd˝os and S´os

Transference for loose Hamilton cycles in random $3$-uniform hypergraphs

A loose Hamilton cycle in a hypergraph is a cyclic sequence of edges covering all vertices in which only every two consecutive edges intersect and do so in exactly one vertex. With Dirac’s theorem in