Almost all Steiner triple systems have perfect matchings
From MaRDI portal
Publication:3389173
DOI10.1112/plms.12373zbMath1462.05045arXiv1611.02246OpenAlexW3100797722MaRDI QIDQ3389173
Publication date: 10 May 2021
Published in: Proceedings of the London Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1611.02246
Random graphs (graph-theoretic aspects) (05C80) Combinatorial aspects of block designs (05B05) Hypergraphs (05C65) Orthogonal arrays, Latin squares, Room squares (05B15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Triple systems (05B07)
Related Items (16)
The Existence of Designs via Iterative Absorption: Hypergraph 𝐹-designs for Arbitrary 𝐹 ⋮ Dirac-type theorems in random hypergraphs ⋮ Almost all optimally coloured complete graphs contain a rainbow Hamilton path ⋮ Substructures in Latin squares ⋮ Transversals in quasirandom latin squares ⋮ Covering cycles in sparse graphs ⋮ Factors and loose Hamilton cycles in sparse pseudo‐random hypergraphs ⋮ Hamilton transversals in random Latin squares ⋮ Enumerating matroids and linear spaces ⋮ Large deviations in random latin squares ⋮ Steiner triple systems of order 21 with subsystems ⋮ Combinatorics, probability and computing. Abstracts from the workshop held April 24--30, 2022 ⋮ Large monochromatic components in 3‐edge‐colored Steiner triple systems ⋮ Almost all Steiner triple systems are almost resolvable ⋮ Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification ⋮ From one to many rainbow Hamiltonian cycles
This page was built for publication: Almost all Steiner triple systems have perfect matchings
