English
Related papers

Related papers: Steiner triple systems with high chromatic index

200 papers

A Steiner Triple System ($STS$) of order $v$ is a hypergraph uniform of rank 3, with $v$ vertices and such that every 2-subset of vertices has degree 1. In this paper we give a construction, by difference method, of type $v\longrightarrow…

Combinatorics · Mathematics 2025-11-10 Paola Bonacini , Mario Gionfriddo , Lucia Marino

In this paper, we initiate the study of discrepancy questions for combinatorial designs. Specifically, we show that, for every fixed $r\ge 3$ and $n\equiv 1,3 \pmod{6}$, any $r$-colouring of the triples on $[n]$ admits a Steiner triple…

Combinatorics · Mathematics 2025-07-28 Lior Gishboliner , Stefan Glock , Amedeo Sgueglia

A $\delta$-colouring of the point set of a block design is said to be {\em weak} if no block is monochromatic. The {\em chromatic number} $\chi(S)$ of a block design $S$ is the smallest integer $\delta$ such that $S$ has a weak…

Combinatorics · Mathematics 2025-04-17 Andrea C. Burgess , Nicholas J. Cavenagh , Peter Danziger , David A. Pike

We construct Steiner triple systems without parallel classes for an infinite number of orders congruent to $3 \pmod{6}$. The only previously known examples have order $15$ or $21$.

Combinatorics · Mathematics 2020-07-28 Darryn Bryant , Daniel Horsley

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…

Combinatorics · Mathematics 2015-09-21 Andras Gyarfas

For $v\equiv 1$ or 3 (mod 6), maximum partial triple systems on $v$ points are Steiner triple systems, STS($v$)s. The 80 non-isomorphic STS(15)s were first enumerated around 100 years ago, but the next case for Steiner triple systems was…

Combinatorics · Mathematics 2017-10-27 Fatih Demirkale , Diane Donovan , Mike Grannell

In a recent paper (2024) M. Buratti and M.E:Muzychuck have established some lower bounds on the number of non isomorphic cyclic Steiner Triple Systems of order $v\equiv 1$ (mod $6$). We complete their result to the case $v\equiv 3$ (mod…

Combinatorics · Mathematics 2025-09-30 Lotrenzo Mella , Gloria Rinaldi

It was proved in 2009 that any partial Steiner triple system of order $u$ has an embedding of order $v$ for each admissible integer $v\geq 2u+1$. This result is best-possible in the sense that, for each $u\geq 9$, there exists a partial…

Combinatorics · Mathematics 2014-02-13 Daniel Horsley

We initiate the study of extended bicolorings of Steiner triple systems (STS) which start with a $k$-bicoloring of an STS($v$) and end up with a $k$-bicoloring of an STS($2v+1$) obtained by a doubling construction, using only the original…

Combinatorics · Mathematics 2013-09-02 M. Gionfriddo , E. Guardo , L. Milazzo

We initiate the study of extended bicolorings of Steiner triple systems (STS) which start with a $k$-bicoloring of an STS($v$) and end up with a $k$-bicoloring of an STS($2v+1$) obtained by a doubling construction, using only the original…

Combinatorics · Mathematics 2013-08-23 M. Gionfriddo , E. Guardo , L. Milazzo

Every Steiner triple system is a uniform hypergraph. The coloring of hypergraph and its special case Steiner triple systems, {STS}$(v)$, is studied extensively. But the defining set of the coloring of hypergraph even its special case…

Combinatorics · Mathematics 2018-07-24 Nazli Besharati , M. Mortezaeefar

It is known that in any $r$-coloring of the edges of a complete $r$-uniform hypergraph, there exists a spanning monochromatic component. Given a Steiner triple system on $n$ vertices, what is the largest monochromatic component one can…

Combinatorics · Mathematics 2020-02-11 Louis DeBiasio , Michael Tait

A graph is $(c_1, c_2, ..., c_k)$-colorable if the vertex set can be partitioned into $k$ sets $V_1,V_2, ..., V_k$, such that for every $i: 1\leq i\leq k$ the subgraph $G[V_i]$ has maximum degree at most $c_i$. We show that every planar…

Combinatorics · Mathematics 2012-08-17 Owen Hill , Gexin Yu

The smallest open case for classifying Steiner triple systems is order 21. A Steiner triple system of order 21, an STS(21), can have subsystems of orders 7 and 9, and it is known that there are 12,661,527,336 isomorphism classes of STS(21)s…

Combinatorics · Mathematics 2022-08-25 Daniel Heinlein , Patric R. J. Östergård

The $p$-rank of a Steiner triple system $B$ is the dimension of the linear span of the set of characteristic vectors of blocks of $B$, over GF$(p)$. We derive a formula for the number of different Steiner triple systems of order $v$ and…

Combinatorics · Mathematics 2021-03-09 Minjia Shi , Li Xu , Denis S. Krotov

For an integer $\rho$ such that $1 \leq \rho \leq v/3$, define $\beta(\rho,v)$ to be the maximum number of blocks in any partial Steiner triple system on $v$ points in which the maximum partial parallel class has size $\rho$. We obtain…

Combinatorics · Mathematics 2020-07-23 Douglas R. Stinson

We systematically determine circular chromatic index of small graphs and multigraphs with maximum degree $4$, $5$, $6$ (and also their number for a given small order). We construct several infinite families of such graphs with circular…

Combinatorics · Mathematics 2026-03-11 Ján Mazák , Filip Zrubák

A design is said to be $f$-pyramidal when it has an automorphism group which fixes $f$ points and acts sharply transitively on all the others. The problem of establishing the set of values of $v$ for which there exists an $f$-pyramidal…

Combinatorics · Mathematics 2016-04-01 Marco Buratti , Gloria Rinaldi , Tommaso Traetta

Steiner triple systems (STSs) have been classified up to order 19. Earlier estimations of the number of isomorphism classes of STSs of order 21, the smallest open case, are discouraging as for classification, so it is natural to focus on…

Combinatorics · Mathematics 2023-06-22 Daniel Heinlein , Patric R. J. Östergård

Properties of the 62,336,617 Steiner triple systems of order 21 with a non-trivial automorphism group are examined. In particular, there are 28 which have no parallel class, six that are 4-chromatic, five that are 3-balanced, 20 that avoid…

Combinatorics · Mathematics 2024-01-25 Grahame Erskine , Terry S. Griggs
‹ Prev 1 2 3 10 Next ›