For almost all Steiner triple systems on n vertices, every 3-edge-coloring has a monochromatic component on (1-o(1))n vertices.
Almost all Steiner triple systems are almost resolvable
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
abstract
We show that for any n divisible by 3, almost all order-n Steiner triple systems admit a decomposition of almost all their triples into disjoint perfect matchings (that is, almost all Steiner triple systems are almost resolvable).
fields
math.CO 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Large monochromatic components in 3-edge-colored Steiner triple systems
For almost all Steiner triple systems on n vertices, every 3-edge-coloring has a monochromatic component on (1-o(1))n vertices.