K 4-free graphs without large induced triangle-free subgraphs

Abstract

Let f 3,4(n), for a natural number n, be the largest integer m such that every K 4-free graph of order n contains an induced triangle-free subgraph of order m. We prove that for every suffciently large n, f 3,4(n)≤n 1/2(lnn)120. By known results, this bound is tight up to a polylogarithmic factor.

This is a preview of subscription content, access via your institution.

References

  1. [1]

    N. Alon and M. Krivelevich: Constructive bounds for a Ramsey-type problem, Graphs Combin. 13 (1997), 217–225.

    MathSciNet  MATH  Google Scholar 

  2. [2]

    B. Bollobás and H. R. Hind: Graphs without large triangle free subgraphs, Discrete Math. 87 (1991), 119–131.

    MathSciNet  Article  MATH  Google Scholar 

  3. [3]

    A. Dudek and V. Rödl: On K s-free subgraphs in K s+k -free Graphs and Vertex Folkman Numbers, to appear.

  4. [4]

    A. Dudek and V. Rődl: On the function of Erdős and Rogers, Ramsey theory, Progr. Math. vol. 285, Birkhäuser/Springer, New York, 2011, 63–76.

    Google Scholar 

  5. [5]

    P. Erdős and T. Gallai: On the minimal number of vertices representing the edges of a graph., Magyar Tud. Akad. Mat. Kutató Int. Kőzl. 6 (1961), 181–203 (English, with Russian summary).

    Google Scholar 

  6. [6]

    P. Erdős and C. A. Rogers: The construction of certain graphs, Canad. J. Math. 14 (1962), 702–707.

    MathSciNet  Article  Google Scholar 

  7. [7]

    C. Godsil and G. Royle: Algebraic graph theory, Graduate Texts in Mathematics, vol. 207, Springer-Verlag, New York, 2001.

    Google Scholar 

  8. [8]

    S. Janson, T. Luczak and A. Ruciński: Random graphs, Wiley-Interscience Series in Discrete Mathematics and Optimization, Wiley-Interscience, New York, 2000.

    Google Scholar 

  9. [9]

    M. Krivelevich: Bounding Ramsey numbers through large deviation inequalities, Random Structures Algorithms 7 (1995), 145–155.

    MathSciNet  Article  MATH  Google Scholar 

  10. [10]

    M. Krivelevich: K s-free graphs without large K r-free subgraphs, Combin. Probab. Comput. 3 (1994), 349–354.

    MathSciNet  Article  MATH  Google Scholar 

  11. [11]

    N. Linial and Y. Rabinovich: Local and global clique numbers, J. Combin. Theory Ser. B 61 (1994), 5–15.

    MathSciNet  Article  MATH  Google Scholar 

  12. [12]

    C. McDiarmid: On the method of bounded differences, Surveys in combinatorics, 1989 (Norwich, 1989), London Math. Soc. Lecture Note Ser., vol. 141, Cambridge Univ.Press, Cambridge, 1989, 148–188.

    Google Scholar 

  13. [13]

    B. Sudakov: A new lower bound for a Ramsey-type problem, Combinatorica 25 (2005), 487–498.

    MathSciNet  Article  MATH  Google Scholar 

  14. [14]

    B. Sudakov: Large K r-free subgraphs in K s-free graphs and some other Ramseytype problems, Random Structures Algorithms 26 (2005), 253–265.

    MathSciNet  Article  MATH  Google Scholar 

  15. [15]

    L. Warnke: When does the K 4-free process stop? (2010), available at arXiv:1007.3037v2[math.CO].

    Google Scholar 

  16. [16]

    G. Wolfovitz: The K 4-free process (2010), available at arXiv:1008.4044v1[math.CO].

    Google Scholar 

Download references

Author information

Affiliations

Authors

Corresponding author

Correspondence to Guy Wolfovitz.

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Wolfovitz, G. K 4-free graphs without large induced triangle-free subgraphs. Combinatorica 33, 623–631 (2013). https://doi.org/10.1007/s00493-013-2845-x

Download citation

Mathematics Subject Classification (2010)

  • 05C35
  • 05D40