Large Cross-free sets in Steiner triple systems

TL;DR

This paper investigates the existence of large cross-free sets in Steiner triple systems, proving a conjecture for specific cases and exploring implications for colorings and connected components.

Contribution

It proves the conjecture for Steiner triple systems of order 18k+3, constructing systems with maximal cross-free sets and analyzing monochromatic components in colorings.

Findings

Constructed STS(18k+3) with cross-free sets of size 6k.

Showed that in any 3-coloring, a large monochromatic connected component exists.

Established bounds for monochromatic components in r-colorings for certain parameters.

Abstract

A {\em cross-free} set of size $m$ in a Steiner triple system $(V,{\cal{B}})$ is three pairwise disjoint $m$-element subsets $X_1,X_2,X_3\subset V$ such that no $B\in {\cal{B}}$ intersects all the three $X_i$-s. We conjecture that for every admissible $n$ there is an STS$(n)$ with a cross-free set of size $\lfloor{n-3\over 3}\rfloor$ which if true, is best possible. We prove this conjecture for the case $n=18k+3$, constructing an STS$(18k+3)$ containing a cross-free set of size $6k$. We note that some of the $3$-bichromatic STSs, constructed by Colbourn, Dinitz and Rosa, have cross-free sets of size close to $6k$ (but cannot have size exactly $6k$). The constructed STS$(18k+3)$ shows that equality is possible for $n=18k+3$ in the following result: in every $3$-coloring of the blocks of any Steiner triple system STS$(n)$ there is a monochromatic connected component of size at least $\lceil{2n\over 3}\rceil+1$ (we conjecture that equality holds for every admissible $n$). The analogue problem can be asked for $r$-colorings as well, if $r-1 \equiv 1,3 \mbox{ (mod 6)}$ and $r-1$ is a prime power, we show that the answer is the same as in case of complete graphs: in every $r$-coloring of the blocks of any STS$(n)$, there is a monochromatic connected component with at least ${n\over r-1}$ points, and this is sharp for infinitely many $n$.