The sum-free process

DOI10.37236/8095zbMath1433.05234arXiv1502.01644OpenAlexW2999170683MaRDI QIDQ2288178

Patrick Bennett

Publication date: 17 January 2020

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Hypergraphs (05C65) Graph algorithms (graph-theoretic aspects) (05C85) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Cites Work

• The early evolution of the \(H\)-free process
• The triangle-free process
• On tail probabilities for martingales
• Random sum-free subsets of abelian groups
• A note on the random greedy independent set algorithm
• The diamond-free process
• The Final Size of the $C_{\ell}$-free Process
• Large triangle packings and Tuza’s conjecture in sparse random graphs
• The Triangle-Free Process and the Ramsey Number 𝑅(3,𝑘)
• Large girth approximate Steiner triple systems
• Triangle‐free subgraphs in the triangle‐free process
• When does the K₄‐free process stop?
• Dynamic concentration of the triangle-free process
• The C_ℓ‐free process

This page was built for publication: The sum-free process