English
Related papers

Related papers: Almost all Steiner triple systems are almost resol…

200 papers

We address several extremal problems concerning the spreading property of point sets of Steiner triple systems. This property is closely related to the structure of subsystems, as a set is spreading if and only if there is no proper…

Combinatorics · Mathematics 2021-03-02 Zoltán Lóránt Nagy , Levente Szemerédi

In a recent work, Jungnickel, Magliveras, Tonchev, and Wassermann derived an overexponential lower bound on the number of nonisomorphic resolvable Steiner triple systems (STS) of order $v$, where $v=3^k$, and $3$-rank $v-k$. We develop an…

Combinatorics · Mathematics 2020-05-25 Minjia Shi , Li Xu , Denis S. Krotov

Let STS(n) denote the number of Steiner triple systems on n vertices, and let F(n) denote the number of 1-factorizations of the complete graph on n vertices. We prove the following upper bound. STS(n) <= ((1 + o(1)) (n/e^2))^(n^2/6) F(n) <=…

Combinatorics · Mathematics 2011-10-13 Nathan Linial , Zur Luria

We prove that almost every triangle can be dissected only into $n^2$ triangles which have to be equal one another. Moreover, such a dissection is unique for every $n$. It turns out that to solve this "simple" problem it is convenient to use…

Metric Geometry · Mathematics 2021-02-23 Andrey Ryabichev

In 1847, Kirkman proved that there exists a Steiner triple system on $n$ vertices (equivalently a triangle decomposition of the edges of $K_n$) whenever $n$ satisfies the necessary divisibility conditions (namely $n\equiv 1,3 \mod 6$). In…

Combinatorics · Mathematics 2025-08-01 Michelle Delcourt , Cicely , Henderson , Thomas Lesgourgues , Luke Postle

A triple system is cancellative if it does not contain three distinct sets $A,B,C$ such that the symmetric difference of $A$ and $B$ is contained in $C$. We show that every cancellative triple system $\mathcal{H}$ that satisfies certain…

Combinatorics · Mathematics 2021-03-30 Xizhi Liu

Nested Steiner quadruple systems are designs derived from Steiner quadruple systems (SQSs) by partitioning each block into pairs. A nested SQS is completely uniform if every possible pair appears with equal multiplicity, and completely…

Combinatorics · Mathematics 2026-01-27 Xiao-Nan Lu

We prove a 1973 conjecture due to Erd\H{o}s on the existence of Steiner triple systems with arbitrarily high girth.

Combinatorics · Mathematics 2024-05-07 Matthew Kwan , Ashwin Sah , Mehtaab Sawhney , Michael Simkin

We give estimates on the number of combinatorial designs, which prove (and generalise) a conjecture of Wilson from 1974 on the number of Steiner Triple Systems. This paper also serves as an expository treatment of our recently developed…

Combinatorics · Mathematics 2015-04-14 Peter Keevash

Let $X$ be a $v$-set, $\B$ a set of 3-subsets (triples) of $X$, and $\B^+\cup\B^-$ a partition of $\B$ with $|\B^-|=s$. The pair $(X,\B)$ is called a simple signed Steiner triple system, denoted by ST$(v,s)$, if the number of occurrences of…

Combinatorics · Mathematics 2011-11-15 E. Ghorbani , G. B. Khosrovshahi

We give the classification of solvable and splitting Lie triple system and it turn that, up to isomorphism there exist 7 non isomorphic canonical Lie triple systems and 6 non isomorphic splitting canonical Lie triple systems and find the…

Differential Geometry · Mathematics 2007-05-23 Thomas Bouetou Bouetou

We introduce a uniform method of proof for the following results. For {\em each} of the following conditions, there are $2^{\aleph_0}$ families of Steiner systems, satisfying that condition: i) Theorem~2.2.4: (extending \cite{Chicoetal})…

Combinatorics · Mathematics 2022-01-28 John T. Baldwin

Let S denote a Steiner triple system on an n-element set. An orientation of S is an assignment of a cyclic ordering to each of the triples in S. From an oriented Steiner triple system, one can define an anticommutative bilinear operation on…

Combinatorics · Mathematics 2025-07-15 Jake Kettinger , Chris Peterson

Free Steiner triple systems (STS) are infinite structures that are naturally characterised by a universal property. We consider the class of free STSs from a model theoretic viewpoint. We show that free STSs on any number of generators are…

Logic · Mathematics 2026-02-25 Silvia Barbina , Enrique Casanovas

We prove that with high probability $\mathbb{G}^{(3)}(n,n^{-1+o(1)})$ contains a spanning Steiner triple system for $n\equiv 1,3\pmod{6}$, establishing the exponent for the threshold probability for existence of a Steiner triple system. We…

Combinatorics · Mathematics 2022-05-04 Ashwin Sah , Mehtaab Sawhney , Michael Simkin

A Kirkman triple system of order $v$, KTS$(v)$, is a resolvable Steiner triple system on $v$ elements. In this paper, we investigate an open problem posed by Doug Stinson, namely the existence of KTS$(v)$ which contain as a subdesign a…

Combinatorics · Mathematics 2021-10-18 Peter Dukes , Esther Lamken

In 1973, Erd\H{o}s conjectured the existence of high girth $(n,3,2)$-Steiner systems. Recently, Glock, K\"{u}hn, Lo, and Osthus and independently Bohman and Warnke proved the approximate version of Erd\H{o}s' conjecture. Just this year,…

Combinatorics · Mathematics 2024-12-30 Michelle Delcourt , Luke Postle

In order to study the structure of arbitrary split Leibniz triple systems, we introduce the class of split Leibniz triple systems as the natural extension of the class of split Lie triple systems and split Leibniz algebras. By developing…

Rings and Algebras · Mathematics 2017-07-04 Yan Cao , Laingyun Chen

In this paper, we show that if $k\geq 6$ and $k \equiv 2 \pmod 4$, then there exists an almost resolvable $k$-cycle system of order $2kt+1$ for all $t\ge 1$ except possibly for $t=2$ and $k\geq 14$. Thus we give a partial solution to an…

Combinatorics · Mathematics 2018-04-30 L. Wang , H. Cao

An l-good sequencing of a Steiner triple system of order v, STS(v), is a permutation of the points of the system such that no l consecutive points in the permutation contains a block. It is known that every STS(v) with v > 3 has a 3-good…

Combinatorics · Mathematics 2022-04-07 Grahame Erskine , Terry Griggs