Hostname: page-component-7b7567c8c-wxvwp Total loading time: 0 Render date: 2026-11-15T04:21:19.216Z Has data issue: false hasContentIssue false

Almost all Steiner triple systems are almost resolvable

Published online by Cambridge University Press:  03 November 2020

Asaf Ferber
Affiliation:
Department of Mathematics, University of California, Irvine, California, USA; E-mail: asaff@uci.edu
Matthew Kwan
Affiliation:
Department of Mathematics, Stanford University, Stanford, California 94305, USA; E-mail: mattkwan@stanford.edu

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

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).

Information

Type
Discrete Mathematics
Creative Commons
Creative Common License - CCCreative Common License - BY
This is an Open Access article, distributed under the terms of the Creative Commons Attribution licence (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted re-use, distribution, and reproduction in any medium, provided the original work is properly cited.
Copyright
© The Author(s), 2020. Published by Cambridge University Press