Graphs and Combinatorics

, Volume 2, Issue 1, pp 189–190 | Cite as

Two problems in extremal graph theory

  • P. Erdös
Research Problems


Graph Theory Extremal Graph Extremal Graph Theory 


  1. 1.
    Erdös, P.: Some new applications of probability methods to combinatorial analysis and graph theory. In: Proc. Fifth Southeastern Conf. on Combinatorics, Graph Theory, and Computing, pp. 39–51. Winnipeg: Utilitas Math. Publ. 1974Google Scholar
  2. 2.
    Erdös, P., Faudree, R., Pach, J., Spencer, J.: How to make a graph bipartite. J. Comb. Theory (B) (submitted)Google Scholar

Copyright information

© Springer-Verlag 1986

Authors and Affiliations

  • P. Erdös
    • 1
  1. 1.Mathematical Institute of the Hungarian Academy of SciencesBudapestHungary

Personalised recommendations