Note on a Ramsey-Turán type problem | Graphs and Combinatorics
Skip to main content
Springer Nature Link
Log in

Note on a Ramsey-Turán type problem

  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

    We’re sorry, something doesn't seem to be working properly.

    Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.

Abstract

Solving a problem of Erdös the existence of a graph withn vertices,cn 2 edges and withoutK(4) andK(3, 3, 3) is proved. It remains an open question whether all such graphs containK(2, 2, 2).

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
¥17,985 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price includes VAT (Japan)

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Bollobás, B., Erdös, P.: On a Ramsey-Turán Type Problem. J. Comb. Theory (B)21, 166–168 (1976).

    Article  MATH  Google Scholar 

  2. Erdös, P.: Graph theory and probability. Canad. J. Math.11, 34–38 (1959).

    MATH  MathSciNet  Google Scholar 

  3. Erdös, P.: Problems and results on graphs and hypergraphs: similarities and differences. In: Recent Trends of Ramsey Theory, edited by Nešetřil, J., Rödl, V. (to appear). Annals Discrete Math. (to appear)

  4. Szemerédi, E.: Graphs without complete quadrilaterals (in Hungarian), Mat. Lapok23, 113–116 (1973)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Fakulta Jaderná a Fyzikálnê Inženýrská, Katedra Matematiky, Husova 5, Prague, Czechoslovakia

    Vojtêch Rödl

Authors
  1. Vojtêch Rödl
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Rödl, V. Note on a Ramsey-Turán type problem. Graphs and Combinatorics 1, 291–293 (1985). https://doi.org/10.1007/BF02582954

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02582954

Keywords

Search

Navigation