The sharp threshold for making squares
From MaRDI portal
Publication:1643387
DOI10.4007/annals.2018.188.1.2zbMath1430.11165arXiv1608.03857OpenAlexW2963652582MaRDI QIDQ1643387
Béla Bollobás, Robert Morris, Paul N. Balister
Publication date: 19 June 2018
Published in: Annals of Mathematics. Second Series (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1608.03857
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On sharp transitions in making squares
- A note on the random greedy triangle-packing algorithm
- Bootstrap percolation on the random graph \(G_{n,p}\)
- On a problem of Oppenheim concerning Factorisatio Numerorum
- On the number of positive integers \(\leq x\) and free of prime factors \(>y\)
- Integers without large prime factors
- Random triangle removal
- Weighted sums of certain dependent random variables
- An approximation theorem for the Poisson binomial distribution
- SIR epidemics on random graphs with a fixed degree sequence
- Factorization of a 768-Bit RSA Modulus
- On Integers Free of Large Prime Factors
- Asymptotically Fast Factorization of Integers
- Probability with Martingales
- The Most Frequent Values of the Largest Prime Divisor Function
- Probability Inequalities for Sums of Bounded Random Variables
- The Satisfiability Threshold fork-XORSAT
- The sharp threshold for bootstrap percolation in all dimensions
- Dynamic concentration of the triangle-free process
- Hamiltonicity of random graphs produced by 2‐processes
- Solutions of ordinary differential equations as limits of pure jump markov processes
- A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
