On a conjecture of Erdős on locally sparse Steiner triple systems

DOI10.1007/s00493-019-4084-2zbMath1463.05030arXiv1802.04227OpenAlexW3022329050WikidataQ123250793 ScholiaQ123250793MaRDI QIDQ2216922

Deryk Osthus, Stefan Glock, Allan Lo, Daniela Kühn

Publication date: 18 December 2020

Published in: Combinatorica (Search for Journal in Brave)

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

zbMATH Keywords

girthsparsesupermartingaleforbidden configurationpartial Steiner triple systemtriangle removal process

Mathematics Subject Classification ID

Martingales with discrete parameter (60G42) Hypergraphs (05C65) Combinatorial probability (60C05) Other designs, configurations (05B30) Triple systems (05B07)

Related Items (max. 100)

On the power of random greedy algorithms ⋮ 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 ⋮ Combinatorics, probability and computing. Abstracts from the workshop held April 24--30, 2022 ⋮ Threshold for Steiner triple systems ⋮ The Brown-Erdős-Sós conjecture in finite abelian groups ⋮ A Ramsey variant of the Brown–Erdős–Sós conjecture

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Uniform hypergraphs containing no grids
• On regular hypergraphs of high girth
• Asymptotic behavior of the chromatic index for hypergraphs
• On 6-sparse Steiner triple systems
• The early evolution of the \(H\)-free process
• On tail probabilities for martingales
• On random greedy triangle packing
• Counting designs
• Random triangle removal
• 5-sparse Steiner triple systems of order \(n\) exist for almost all admissible \(n\)
• A note on the random greedy independent set algorithm
• An upper bound on the number of Steiner triple systems
• On the Random Greedy $F$-Free Hypergraph Process
• Construction Techniques for Anti-Pasch Steiner Triple Systems
• The random k‐matching‐free process
• Extremal problems for triple systems
• Random maximalH-free graphs
• Asymptotic packing via a branching process
• Large girth approximate Steiner triple systems
• When does the K₄‐free process stop?
• The C_ℓ‐free process
• The Existence of Designs via Iterative Absorption: Hypergraph 𝐹-designs for Arbitrary 𝐹

This page was built for publication: On a conjecture of Erdős on locally sparse Steiner triple systems