Almost all Steiner triple systems are almost resolvable
From MaRDI portal
Publication:5135409
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).
Recommendations
Cites work
- scientific article; zbMATH DE number 3150484 (Why is no real title available?)
- scientific article; zbMATH DE number 1314686 (Why is no real title available?)
- scientific article; zbMATH DE number 1944144 (Why is no real title available?)
- scientific article; zbMATH DE number 1540669 (Why is no real title available?)
- scientific article; zbMATH DE number 3392464 (Why is no real title available?)
- scientific article; zbMATH DE number 4183425 (Why is no real title available?)
- A generalisation of \(t\)-designs
- A geometric theory for hypergraph matching
- Algebraic Speculations About Steiner Systems
- Almost All Steiner Triple Systems Are Asymmetric
- Almost all Steiner triple systems have perfect matchings
- An approximate Dirac-type theorem for \(k\)-uniform hypergraphs
- Asymptotic behavior of the chromatic index for hypergraphs
- Concentration inequalities. A nonasymptotic theory of independence
- Counting designs
- Discrepancy of high-dimensional permutations
- Edge-disjoint Hamilton cycles in random graphs
- Factors in random graphs
- Hamilton decompositions of regular expanders: A proof of Kelly's conjecture for large tournaments
- Intercalates and discrepancy in random Latin squares
- Most Latin squares have many subsquares
- Nearly perfect matchings in regular simple hypergraphs
- On \(K^ 4\)-free subgraphs of random graphs
- On a packing and covering problem
- On perfect matchings in uniform hypergraphs with large minimum vertex degree
- On tail probabilities for martingales
- On the KŁR conjecture in random graphs
- On the method of typical bounded differences
- Packing Hamilton cycles in random and pseudo-random hypergraphs
- Packing, counting and covering Hamilton cycles in random directed graphs
- Random regular graphs of high degree
- Reducibility among combinatorial problems
- Steiner triple systems without parallel classes
- The existence of Latin squares without orthogonal mates
- The infamous upper tail
- Weak hypergraph regularity and linear hypergraphs
- Weak quasi-randomness for uniform hypergraphs
Cited in
(16)- Large monochromatic components in 3‐edge‐colored Steiner triple systems
- Complementary partial resolution squares for Steiner triple systems
- Steiner almost self-complementary graphs and halving near-Steiner triple systems
- Dirac-type theorems in random hypergraphs
- Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification
- Ryser's conjecture for \(t\)-intersecting hypergraphs
- Substructures in Latin squares
- The growth rate of multicolor Ramsey numbers of 3-graphs
- Transference for loose Hamilton cycles in random 3-uniform hypergraphs
- Almost all Steiner triple systems have perfect matchings
- On oriented cycles in randomly perturbed digraphs
- Almost all optimally coloured complete graphs contain a rainbow Hamilton path
- The resolution of the anti‐mitre Steiner triple system conjecture
- Almost resolvable duplicated Steiner triple systems
- Large deviations in random latin squares
- Packing paths in Steiner triple systems
This page was built for publication: Almost all Steiner triple systems are almost resolvable
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5135409)
