Skip to main content
×
Home
    • Aa
    • Aa
  • Get access
    Check if you have access via personal or institutional login
  • Cited by 5
  • Cited by
    This article has been cited by the following publications. This list is generated based on data provided by CrossRef.

    Bennett, Patrick and Bohman, Tom 2016. A note on the random greedy independent set algorithm. Random Structures & Algorithms, Vol. 49, Issue. 3, p. 479.


    Makai, Tamás 2015. The ReverseH-free Process for Strictly 2-Balanced Graphs. Journal of Graph Theory, Vol. 79, Issue. 2, p. 125.


    Picollelli, Michael E. 2014. The Final Size of the $C_{\ell}$-free Process. SIAM Journal on Discrete Mathematics, Vol. 28, Issue. 3, p. 1276.


    Picollelli, Michael E. 2014. The diamond-free process. Random Structures & Algorithms, Vol. 45, Issue. 3, p. 513.


    Warnke, Lutz 2014. TheCℓ-free process. Random Structures & Algorithms, Vol. 44, Issue. 4, p. 490.


    ×
  • Combinatorics, Probability and Computing, Volume 20, Issue 6
  • November 2011, pp. 939-955

The Final Size of the C4-Free Process

  • MICHAEL E. PICOLLELLI (a1)
  • DOI: http://dx.doi.org/10.1017/S0963548311000368
  • Published online: 05 September 2011
Abstract

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.

Copyright
Linked references
Hide All

This list contains references from the content that can be linked to their source. For a full set of references and notes please see the PDF or HTML where available.

[1]N. Alon , M. Krivelevich and B. Sudakov (1999) Coloring graphs with sparse neighborhoods. J. Combin. Theory Ser. B 77 7382.

[2]T. Bohman (2009) The triangle-free process. Adv. Math. 221 16531677.

[3]T. Bohman and P. Keevash (2010) The early evolution of the H-free process. Invent. Math. 181 291336.

[6]P. Erdős , S. Suen and P. Winkler (1995) On the size of a random maximal graph. Random Struct. Alg. 6 309318.

[8]J. H. Kim (1995) The Ramsey number R(3, t) has order of magnitude t2/logt. Random Struct. Alg. 7 173207.

[9]D. Osthus and A. Taraz (2001) Random maximal H-free graphs. Random Struct. Alg. 18 6182.

[12]J. Spencer (1990) Counting extensions. J. Combin. Theory Ser. A 55 247255.

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? *
×