Skip to main content

The Final Size of the C4-Free Process


We consider the following random graph process: starting with n isolated vertices, add edges uniformly at random provided no such edge creates a copy of C4. We show that, with probability tending to 1 as n → ∞, the final graph produced by this process has maximum degree O((nlogn)1/3) and consequently size O(n4/3(logn)1/3), which are sharp up to constants. This confirms conjectures of Bohman and Keevash and of Osthus and Taraz, and improves upon previous bounds due to Bollobás and Riordan and Osthus and Taraz.

Hide All
[1]Alon N., Krivelevich M. and Sudakov B. (1999) Coloring graphs with sparse neighborhoods. J. Combin. Theory Ser. B 77 7382.
[2]Bohman T. (2009) The triangle-free process. Adv. Math. 221 16531677.
[3]Bohman T. and Keevash P. (2010) The early evolution of the H-free process. Invent. Math. 181 291336.
[4]Bollobás B. (2001) Random Graphs, second edition, Cambridge University Press.
[5]Bollobás B. and Riordan O. (2000) Constrained graph processes. Electron. J. Combin. 7 #R18.
[6]Erdős P., Suen S. and Winkler P. (1995) On the size of a random maximal graph. Random Struct. Alg. 6 309318.
[7]Gerke S. and Makai T. (2010) No dense subgraphs appear in the triangle-free graph process. Manuscript. arXiv:1002.2316
[8]Kim J. H. (1995) The Ramsey number R(3, t) has order of magnitude t 2/logt. Random Struct. Alg. 7 173207.
[9]Osthus D. and Taraz A. (2001) Random maximal H-free graphs. Random Struct. Alg. 18 6182.
[10]Picollelli M. (2010) The diamond-free process. Manuscript. arXiv:1010.5207
[11]Ruciński A. and Wormald N. (1992) Random graph processes with degree restrictions. Combin. Probab. Comput. 1 169180.
[12]Spencer J. (1990) Counting extensions. J. Combin. Theory Ser. A 55 247255.
[13]Spencer J. Maximal trianglefree graphs and Ramsey R(3, k). Unpublished manuscript.
[14]Warnke L. Dense subgraphs in the H-free process. Discrete Math., to appear. arXiv:1003.0220
[15]Warnke L. (2010) When does the K 4-free process stop? Manuscript. arXiv:1007.3037
[16]Wolfovitz G. (2009) Lower bounds for the size of maximal H-free graphs. Electron. J. Combin. 16 #R4.
[17]Wolfovitz G. (2010) The K 4-free process. Manuscript. arXiv:1008.4044
[18]Wolfovitz G. Triangle-free subgraphs in the triangle-free process. Random Struct. Alg., to appear. arXiv:0903.1756
[19]Wormald N. (1999) The differential equation method for random graph processes and greedy algorithms. In Lectures on Approximation and Randomized Algorithms (Karonski M. and Prömel H. J., eds), pp. 73155, PWN, Warsaw.
Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

Combinatorics, Probability and Computing
  • ISSN: 0963-5483
  • EISSN: 1469-2163
  • URL: /core/journals/combinatorics-probability-and-computing
Please enter your name
Please enter a valid email address
Who would you like to send this to? *


Full text views

Total number of HTML views: 0
Total number of PDF views: 10 *
Loading metrics...

Abstract views

Total abstract views: 104 *
Loading metrics...

* Views captured on Cambridge Core between September 2016 - 21st November 2017. This data will be updated every 24 hours.