Almost all Steiner triple systems are almost resolvable

Ferber A, Kwan MA. 2020. Almost all Steiner triple systems are almost resolvable. Forum of Mathematics. 8, e39.

Download
OA 2020_CambridgeUniversityPress_Ferber.pdf 601.52 KB

Journal Article | Published | English

Scopus indexed
Author
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).
Publishing Year
Date Published
2020-11-03
Journal Title
Forum of Mathematics
Volume
8
Article Number
e39
eISSN
IST-REx-ID

Cite this

Ferber A, Kwan MA. Almost all Steiner triple systems are almost resolvable. Forum of Mathematics. 2020;8. doi:10.1017/fms.2020.29
Ferber, A., & Kwan, M. A. (2020). Almost all Steiner triple systems are almost resolvable. Forum of Mathematics. Cambridge University Press. https://doi.org/10.1017/fms.2020.29
Ferber, Asaf, and Matthew Alan Kwan. “Almost All Steiner Triple Systems Are Almost Resolvable.” Forum of Mathematics. Cambridge University Press, 2020. https://doi.org/10.1017/fms.2020.29.
A. Ferber and M. A. Kwan, “Almost all Steiner triple systems are almost resolvable,” Forum of Mathematics, vol. 8. Cambridge University Press, 2020.
Ferber A, Kwan MA. 2020. Almost all Steiner triple systems are almost resolvable. Forum of Mathematics. 8, e39.
Ferber, Asaf, and Matthew Alan Kwan. “Almost All Steiner Triple Systems Are Almost Resolvable.” Forum of Mathematics, vol. 8, e39, Cambridge University Press, 2020, doi:10.1017/fms.2020.29.
All files available under the following license(s):
Creative Commons Attribution 4.0 International Public License (CC-BY 4.0):
Main File(s)
Access Level
OA Open Access
Date Uploaded
2021-06-22
MD5 Checksum
5553c596bb4db0f38226a56bee9c87a1


Export

Marked Publications

Open Data IST Research Explorer

Sources

PMID: 1907.06744
PubMed | Europe PMC

Search this title in

Google Scholar