Large girth approximate Steiner triple systems

DOI10.1112/jlms.12242zbMath1433.05050arXiv1808.01065OpenAlexW3100428902WikidataQ127713740 ScholiaQ127713740MaRDI QIDQ5217914

Tom Bohman, Lutz Warnke

Publication date: 26 February 2020

Published in: Journal of the London Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1808.01065

zbMATH Keywords

approximate Steiner triple systems with arbitrary high girth

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05) Other designs, configurations (05B30) Stochastic processes (60G99) Triple systems (05B07)

Related Items

On the power of random greedy algorithms ⋮ Connectivity of the linear uniform hypergraph process ⋮ A gentle introduction to the differential equation method and dynamic concentration ⋮ Degenerate Turán Densities of Sparse Hypergraphs II: A Solution to the Brown-Erdős-Sós Problem for Every Uniformity ⋮ Substructures in Latin squares ⋮ A randomized construction of high girth regular graphs ⋮ Counting extensions revisited ⋮ Combinatorics, probability and computing. Abstracts from the workshop held April 24--30, 2022 ⋮ Spreading linear triple systems and expander triple systems ⋮ Approximate Steiner (r − 1, r, n)‐systems without three blocks on r + 2 points ⋮ On a conjecture of Erdős on locally sparse Steiner triple systems ⋮ The sum-free process ⋮ Degenerate Turán densities of sparse hypergraphs ⋮ The Brown-Erdős-Sós conjecture in finite abelian groups ⋮ Triple systems with no three triples spanning at most five points ⋮ A Ramsey variant of the Brown–Erdős–Sós conjecture

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On regular hypergraphs of high girth
• Dense subgraphs in the \(H\)-free process
• A note on the random greedy triangle-packing algorithm
• On 6-sparse Steiner triple systems
• The early evolution of the \(H\)-free process
• The triangle-free process
• On tail probabilities for martingales
• Counting designs
• Packing nearly optimal Ramsey \(R(3,t)\) graphs
• Random triangle removal
• 5-sparse Steiner triple systems of order \(n\) exist for almost all admissible \(n\)
• The Final Size of the $C_{\ell}$-free Process
• Extremal problems for triple systems
• The (7, 4)-Conjecture in Finite Groups
• On the Method of Typical Bounded Differences
• Triangle‐free subgraphs in the triangle‐free process
• When does the K₄‐free process stop?
• Dynamic concentration of the triangle-free process
• Infinite classes of anti‐mitre and 5‐sparse Steiner triple systems
• The C_ℓ‐free process