Almost all Steiner triple systems are almost resolvable. (3rd November 2020)
- Record Type:
- Journal Article
- Title:
- Almost all Steiner triple systems are almost resolvable. (3rd November 2020)
- Main Title:
- Almost all Steiner triple systems are almost resolvable
- Authors:
- Ferber, Asaf
Kwan, Matthew - Abstract:
- 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 ).
- Is Part Of:
- Forum of mathematics. Volume 8(2020)
- Journal:
- Forum of mathematics
- Issue:
- Volume 8(2020)
- Issue Display:
- Volume 8, Issue 2020 (2020)
- Year:
- 2020
- Volume:
- 8
- Issue:
- 2020
- Issue Sort Value:
- 2020-0008-2020-0000
- Page Start:
- Page End:
- Publication Date:
- 2020-11-03
- Subjects:
- 35P15, -- 58C40, -- 53A07
survey design, -- measurement error, -- machine learning
Mathematics -- Periodicals
510 - Journal URLs:
- http://journals.cambridge.org/action/displayJournal?jid=FMS ↗
- DOI:
- 10.1017/fms.2020.29 ↗
- Languages:
- English
- ISSNs:
- 2050-5094
- Deposit Type:
- Legaldeposit
- View Content:
- Available online (eLD content is only available in our Reading Rooms) ↗
- Physical Locations:
- British Library HMNTS - ELD Digital store
- Ingest File:
- 15289.xml