Almost all Steiner triple systems are almost resolvable
From MaRDI portal
Publication:5135409
DOI10.1017/fms.2020.29zbMath1453.05018arXiv1907.06744OpenAlexW3095650743MaRDI QIDQ5135409
Publication date: 20 November 2020
Published in: Forum of Mathematics, Sigma (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1907.06744
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Triple systems (05B07)
Related Items (7)
Dirac-type theorems in random hypergraphs ⋮ Almost all optimally coloured complete graphs contain a rainbow Hamilton path ⋮ Substructures in Latin squares ⋮ Large deviations in random latin squares ⋮ Large monochromatic components in 3‐edge‐colored Steiner triple systems ⋮ Ryser's conjecture for \(t\)-intersecting hypergraphs ⋮ Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the KŁR conjecture in random graphs
- Asymptotic behavior of the chromatic index for hypergraphs
- The existence of Latin squares without orthogonal mates
- An approximate Dirac-type theorem for \(k\)-uniform hypergraphs
- Weak hypergraph regularity and linear hypergraphs
- A generalisation of \(t\)-designs
- On a packing and covering problem
- On tail probabilities for martingales
- Most Latin squares have many subsquares
- Nearly perfect matchings in regular simple hypergraphs
- On \(K^ 4\)-free subgraphs of random graphs
- Counting designs
- Hamilton decompositions of regular expanders: A proof of Kelly's conjecture for large tournaments
- Random regular graphs of high degree
- Discrepancy of high-dimensional permutations
- Packing hamilton cycles in random and pseudo-random hypergraphs
- Weak quasi-randomness for uniform hypergraphs
- Almost all Steiner triple systems have perfect matchings
- Factors in random graphs
- On Perfect Matchings in Uniform Hypergraphs with Large Minimum Vertex Degree
- Algebraic Speculations About Steiner Systems
- Almost All Steiner Triple Systems Are Asymmetric
- The infamous upper tail
- Intercalates and discrepancy in random Latin squares
- Reducibility among Combinatorial Problems
- Steiner Triple Systems without Parallel Classes
- Edge-disjoint Hamilton cycles in random graphs
- On the Method of Typical Bounded Differences
- A geometric theory for hypergraph matching
- Packing, counting and covering Hamilton cycles in random directed graphs
This page was built for publication: Almost all Steiner triple systems are almost resolvable
