# The phase transition in random graphs: A simple proof

@article{Krivelevich2013ThePT,
title={The phase transition in random graphs: A simple proof},
author={Michael Krivelevich and Benny Sudakov},
journal={Random Structures \& Algorithms},
year={2013},
volume={43}
}
• Published 31 January 2012
• Mathematics
• Random Structures & Algorithms
The classical result of Erdős and Rényi asserts that the random graph G(n,p) experiences sharp phase transition around \documentclass{article}\usepackage{mathrsfs}\usepackage{amsmath}\pagestyle{empty}\begin{document}\begin{align*}p=\frac{1}{n}\end{align*} \end{document} – for any ε > 0 and \documentclass{article}\usepackage{mathrsfs}\usepackage{amsmath}\pagestyle{empty}\begin{document}\begin{align*}p=\frac{1-\epsilon}{n}\end{align*} \end{document}, all connected components of G(n,p) are…
109 Citations

### The phase transition in the multi-type binomial random graph $G(\mathbf{n},P)$

• Mathematics, Computer Science
• 2014
We determine the asymptotic size of the largest component in the $2$-type binomial random graph $G(\mathbf{n},P)$ near criticality using a refined branching process approach. In $G(\mathbf{n},P)$

### Short proofs for long induced paths

• Mathematics, Computer Science
Comb. Probab. Comput.
• 2022
A modification of the Depth first search algorithm, suited for finding long induced paths, is presented, and the induced size-Ramsey number of paths satisfies, giving an explicit constant in the linear bound.

### On Coloring Random Subgraphs of a Fixed Graph

It is shown that for any graph $G$ with chromatic number k = \chi(G) and independence number O(n/k) it holds that $\mathbb{E}[G_{1/2})] \geq \Omega \left( k/\log(k) \right)$, which gives a positive answer to the question of Bukh for a large family of graphs.

### The Phase Transition in Multitype Binomial Random Graphs

• Mathematics, Computer Science
SIAM J. Discret. Math.
• 2015
We determine the asymptotic size of the largest component in the $2$-type binomial random graph $G(\mathbf{n},P)$ near criticality using a refined branching process approach. In $G(\mathbf{n},P)$

### Ramsey goodness of trees in random graphs

• Mathematics
• 2020
We say that a graph $G$ is Ramsey for $H_1$ versus $H_2$, and write $G \to (H_1,H_2)$, if every red-blue colouring of the edges of $G$ contains either a red copy of $H_1$ or a blue copy of $H_2$. In

### The Phase Transition in Site Percolation on Pseudo-Random Graphs

The existence of the phase transition in site percolation on pseudo-random $d$-regular graphs is established and typically $R$ contains a connected component of size at least $\frac{\epsilon n}{d}$ and a path of length proportional to the eigenvalue ratio.

### Expansion in randomly perturbed connected graphs and its consequences

• Mathematics
• 2013
We propose a unified approach, based on expansion, to analyzing combinatorial properties of random perturbations of connected graphs. Given an $n$-vertex connected graph $G$, form a random supergraph

### Sandwiching random regular graphs between binomial random graphs

• Mathematics, Computer Science
SODA
• 2020

### Largest Components in Random Hypergraphs

• Mathematics
Combinatorics, Probability and Computing
• 2018
It is shown that the existence of a j-tuple-connected component containing Θ(nj) j-sets undergoes a phase transition and the threshold occurs at edge probability, which controls the structure of the component grown in the search process.