Advertisement

Graphs and Combinatorics

, Volume 1, Issue 1, pp 291–293 | Cite as

Note on a Ramsey-Turán type problem

  • Vojtêch Rödl
Article

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).

Keywords

Bipartite Graph Complete Graph Type Problem Discrete Math Random Subset 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Bollobás, B., Erdös, P.: On a Ramsey-Turán Type Problem. J. Comb. Theory (B)21, 166–168 (1976).zbMATHCrossRefGoogle Scholar
  2. 2.
    Erdös, P.: Graph theory and probability. Canad. J. Math.11, 34–38 (1959).zbMATHMathSciNetGoogle Scholar
  3. 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)Google Scholar
  4. 4.
    Szemerédi, E.: Graphs without complete quadrilaterals (in Hungarian), Mat. Lapok23, 113–116 (1973)Google Scholar

Copyright information

© Springer-Verlag 1985

Authors and Affiliations

  • Vojtêch Rödl
    • 1
  1. 1.Fakulta Jaderná a Fyzikálnê InženýrskáKatedra MatematikyPragueCzechoslovakia

Personalised recommendations