Skip to main content
SpringerLink
Log in

Generalized ramsey theory for graphs, I. Diagonal numbers

  • Published:
Periodica Mathematica Hungarica Aims and scope Submit manuscript

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

References

  1. V. Chvátal, On finite polarized partition relations,Canad. Math. Bull. 12 (1969), 321–326.

    Google Scholar 

  2. V. Chvátal, Hypergraphs and Ramseyian theorems,Proc. Amer. Math. Soc. (to appear).

  3. P. Erdős, Some remarks on the theory of graphs,Bull. Amer. Math. Soc. 53 (1947), 292–294.

    Google Scholar 

  4. P. Erdős, On the number of complete subgraphs contained in certain graphs,Magyar Tud. Akad. Mat. Kutató Int. Közl. 7 (1962), 459–464.

    Google Scholar 

  5. P. Erdős andJ. W. Moon, On subgraphs of the complete bipartite graph,Canad. Math. Bull. 7 (1964), 35–39.

    Google Scholar 

  6. P. Erdős andR. Radó, Partition calculus in set theory,Bull. Amer. Math. Soc. 62 (1956), 427–489.

    Google Scholar 

  7. P. Erdős andM. Simonovits, A limit theorem in graph theory,Studia Sci. Math. Hungar. 1 (1966), 51–57.

    Google Scholar 

  8. P. Erdős andG. Szekeres, A combinatorial problem in geometry,Compositio Math. 2 (1935), 463–470.

    Google Scholar 

  9. A. W. Goodman, On sets of acquaintances and strangers at any party,Amer. Math. Monthly 66 (1959), 778–783.

    Google Scholar 

  10. R. E. Greenwood andA. M. Gleason, Combinatorial relations and chromatic graphs,Canad. J. Math. 7 (1955), 1–7.

    Google Scholar 

  11. R. K. Guy, A many-facetted problem of Zarankiewicz,The Many Facets of Graph Theory, New York, 1969, 129–148.

  12. F. Harary,Graph Theory, Reading, 1969.

  13. J. W. Moon andL. Moser, On chromatic bipartite graphs,Math. Mag. 35 (1962), 225–227.

    Google Scholar 

  14. C. St. J. A. Nash-Williams, Edge-disjoint spanning trees of finite graphs,J. London Math. Soc. 36 (1961), 445–450.

    Google Scholar 

  15. F. P. Ramsey, On a problem of formal logic,Proc. London Math. Soc. 30 (1930), 264–286.

    Google Scholar 

  16. V. T. Sós, On extremal problems in graph theory,Combinatorial Structures and Their Applications, New York, 1970, 407–410.

  17. P. Turán, Egy gráfelméleti szélsőértékfeladatról,Mat. Fiz. Lapok 48 (1941), 436–452; see also, On the theory of graphs,Colloq. Math. 3 (1954), 19–30.

    Google Scholar 

  18. V. G. Vizing, On an estimate of the chromatic class of ap-graph,Diskret. Analiz. 3 (1964), 25–30 (in Russian).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Stanford University, 94305, Stanford, California, U.S.A.

    V. Chvátal

  2. Department of Mathematics, University of Michigan, 48104, Ann Arbor, Michigan, U.S.A.

    F. Harary

Authors
  1. V. Chvátal
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. F. Harary
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Dedicated to the memory of Alfréd Rényi

Rights and permissions

Reprints and permissions

About this article

Cite this article

Chvátal, V., Harary, F. Generalized ramsey theory for graphs, I. Diagonal numbers. Period Math Hung 3, 115–124 (1973). https://doi.org/10.1007/BF02018466

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation