Minimum embedding of any Steiner triple system into a 3-sun system via matchings

Giovanni Lo Faro, Antoinette Tripodi

Let $G$ be a simple finite graph and $G^{\prime }$ be a subgraph of $G$. A $G^{\prime }$-design $(X,\mathcal{B})$ of order $n$ is said to be embedded into a $G$-design $(X\cup U,\mathcal{C})$ of order $n+u$,…