Almost all Steiner triple systems are almost resolvable
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).
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Cambridge University Press
2020-01-01
|
| Series: | Forum of Mathematics, Sigma |
| Subjects: | |
| Online Access: | https://www.cambridge.org/core/product/identifier/S2050509420000298/type/journal_article |
| _version_ | 1811156191291637760 |
|---|---|
| author | Asaf Ferber Matthew Kwan |
| author_facet | Asaf Ferber Matthew Kwan |
| author_sort | Asaf Ferber |
| collection | DOAJ |
| description | 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). |
| first_indexed | 2024-04-10T04:47:23Z |
| format | Article |
| id | doaj.art-a8bc1bf9b6b54194b9dd63987417b45a |
| institution | Directory Open Access Journal |
| issn | 2050-5094 |
| language | English |
| last_indexed | 2024-04-10T04:47:23Z |
| publishDate | 2020-01-01 |
| publisher | Cambridge University Press |
| record_format | Article |
| series | Forum of Mathematics, Sigma |
| spelling | doaj.art-a8bc1bf9b6b54194b9dd63987417b45a2023-03-09T12:34:47ZengCambridge University PressForum of Mathematics, Sigma2050-50942020-01-01810.1017/fms.2020.29Almost all Steiner triple systems are almost resolvableAsaf Ferber0Matthew Kwan1Department of Mathematics, University of California, Irvine, California, USA; E-mail:Department of Mathematics, Stanford University, Stanford, California 94305, USA; E-mail: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).https://www.cambridge.org/core/product/identifier/S2050509420000298/type/journal_article35P1558C4053A07survey designmeasurement errormachine learning |
| spellingShingle | Asaf Ferber Matthew Kwan Almost all Steiner triple systems are almost resolvable Forum of Mathematics, Sigma 35P15 58C40 53A07 survey design measurement error machine learning |
| title | Almost all Steiner triple systems are almost resolvable |
| title_full | Almost all Steiner triple systems are almost resolvable |
| title_fullStr | Almost all Steiner triple systems are almost resolvable |
| title_full_unstemmed | Almost all Steiner triple systems are almost resolvable |
| title_short | Almost all Steiner triple systems are almost resolvable |
| title_sort | almost all steiner triple systems are almost resolvable |
| topic | 35P15 58C40 53A07 survey design measurement error machine learning |
| url | https://www.cambridge.org/core/product/identifier/S2050509420000298/type/journal_article |
| work_keys_str_mv | AT asafferber almostallsteinertriplesystemsarealmostresolvable AT matthewkwan almostallsteinertriplesystemsarealmostresolvable |