# The early evolution of the H-free process

@article{Bohman2009TheEE,
title={The early evolution of the H-free process},
author={Tom Bohman and Peter Keevash},
journal={Inventiones mathematicae},
year={2009},
volume={181},
pages={291-336}
}
• Published 4 August 2009
• Mathematics
• Inventiones mathematicae

### When does the K4‐free process stop?

• L. Warnke
• Mathematics
Random Struct. Algorithms
• 2014
An analysis of the K4-free process shows that with high probability G has edges and is ‘nearly regular’, i.e., every vertex has degree .

### The Cℓ‐free process

• L. Warnke
• Mathematics
Random Struct. Algorithms
• 2014
A rigorous way to 'transfer' certain decreasing properties from the binomial random graph to the H-free process is established, which confirms a conjecture of Bohman and Keevash and improves on bounds of Osthus and Taraz.

### The early evolution of the random graph process in planar graphs and related classes

• Mathematics, Computer Science
• 2021
The asymptotic number of edges added up to step t in the early evolution of the random planar graph process when t = O (n) is determined, showing that this result holds for a much more general class of graphs, including outerplanar graph graphs, planar graphs, and graphs on surfaces.

### J an 2 01 1 The C l-free process

The Cl-free process starts with the empty graph on n vertices and adds edges chosen uniformly at random, one at a time, subject to the condition that no copy of Cl is created. For every l ≥ 4 we show

### A pr 2 01 2 The C l-free process

The Cl-free process starts with the empty graph on n vertices and adds edges chosen uniformly at random, one at a time, subject to the condition that no copy of Cl is created. For every l ≥ 4 we show

### The degree-restricted random process is far from uniform

• Mathematics, Computer Science
ArXiv
• 2022
This paper shows that, for degree sequences d n that are not nearly regular, the al graph of the degree-restricted random process is substantially from a uniform random graph with degree sequence d n .

### Supersaturated sparse graphs and hypergraphs

• Mathematics
• 2017
A central problem in extremal graph theory is to estimate, for a given graph $H$, the number of $H$-free graphs on a given set of $n$ vertices. In the case when $H$ is not bipartite, fairly precise

### From flip processes to dynamical systems on graphons

• Mathematics
• 2022
We introduce a class of random graph processes, which we call flip processes. Each such process is given by a rule which is just a function R : Hk → Hk from all labelled k-vertex graphs into itself

## References

SHOWING 1-10 OF 50 REFERENCES

### Random maximal H-free graphs

• Mathematics
Random Struct. Algorithms
• 2001
Given a graph H, a random maximal H-free graph is constructed by the following random greedy process. First assign to each edge of the complete graph on n vertices a birthtime which is uniformly

### Lower Bounds for the Size of Random Maximal H-Free Graphs

This work considers the next random process for generating a maximal H-free graph and shows that ex-(n, K_{r,r}) = \Omega(n^{2-2/(r+1)}(\ln\ln n)^{1/(r^2-1)})\$.

### Some extremal problems in graph theory

We consider only graphs without loops and multiple edges . Gn denotes a graph of n vertices, v(G) , e(G) and X(G) denote the number of vertices, edges, and the chromatic number of the graph G

### Graph Theory and Probability

• P. Erdös
• Mathematics
• 1959
A well-known theorem of Ramsay (8; 9) states that to every n there exists a smallest integer g(n) so that every graph of g(n) vertices contains either a set of n independent points or a complete

### Graph Theory and Probability. II

• P. Erdös
• Mathematics
• 1961
Define f(k, l) as the least integer so t h a t every graph having f(k, l) vertices contains either a complete graph of order k or a set of l independent vertices (a complete graph of order k is a

### Norm-Graphs: Variations and Applications

• Mathematics
J. Comb. Theory, Ser. B
• 1999
It is proved that for every fixed t, there is a family of subsets of an n element set whose so-called dual shatter function is O(mt) and whose discrepancy is ?(n1/2? 1/2tlogn). This settles a problem of Matou?ek.

### Random Graph Processes with Degree Restrictions

• Mathematics
Combinatorics, Probability and Computing
• 1992
It is proved that if n → ∞ with d fixed, then with probability tending to 1, the final result of this process is a graph with ⌊ nd / 2⌋ edges.

### The Independence Number of Graphs with a Forbidden Cycle and Ramsey Numbers

• Mathematics
J. Comb. Optim.
• 2003
It is shown that the independence number of a Ck-free graph is at least c1[∑ d(v)1/( m − 1)](m − 1)/m and that, for odd k, the Ramsey number r(Ck, Kn) is at most c2(nm + 1/log n)1/m.