Finite Ramsey theory is hard

J.A. Bondy and U.S.R. Murty, “Graph theory with applications”, Macmillan, London, 1976.
Book MATH Google Scholar
S.A. Burr, “Generalized Ramsey theorems for graphs—a survey” in Graphs and Combinatorics, lecture notes in Mathematics 406, Springer 1974, 52–75.
Google Scholar
G. Chartrand, A.D. Polimeni, C.C. Rousseau, J. Sheehan and M.J. Stewart, “On Star-Book Ramsey numbers”, Proceedings of Kalamazoo Int. Conference (1980), to appear.
Google Scholar
M. Clancy, “Some small Ramsey numbers”, J.G.T. 1 (1977), 89–91.
Article MathSciNet MATH Google Scholar
P. Erdös and G. Szekeres, “A combinatorial problem in geometry”, Compositio Math. 2 (1935) 463–470.
MathSciNet MATH Google Scholar
P. Erdös, “Some remarks on the theory of graphs”, Bull. Amer. Math. Soc. 53 (1947), 292–294.
Article MathSciNet MATH Google Scholar
P. Erdös, “On the number of complete subgraphs contained in certain graphs”, Magyar Tud. Akad. Mat. Kut. Int. Közl 7 (1962) 459–474.
MathSciNet MATH Google Scholar
P. Erdös, R.J. Faudree, C.C. Rousseau and R.H. Schelp, “The size Ramsey number”, Per. Math. Hungar. 9 (1978) 145–162.
Article MathSciNet MATH Google Scholar
R.J. Evans, J.R. Pulham and J. Sheehan, “On the number of complete subgraphs contained in certain graphs”, J.C.T. Ser B (to appear).
Google Scholar
L. Gerencsér and A. Gyárfas, “On Ramsey-type problems”, Ann. Univ. Sci. Budapest Eötvös Sect. Math. 10 (1967), 167–170.
MathSciNet MATH Google Scholar
G. Giraud, “Sur le problème de Goodman pour les quadrangles et la majoration des nombres de Ramsey”, J.C.T. Ser. B 27 (1979), 237–253.
Article MathSciNet MATH Google Scholar
A.W. Goodman, “On sets of acquaintances and strangers at any party”, American Math. Monthly, 68 (1961), 107–111.
Article Google Scholar
J. E. Graver and J. Yackel, “Some graph theoretic results associated with Ramsey's theorem”, J.C.T. 4 (1968), 125–175.
Article MathSciNet MATH Google Scholar
R.E. Greewood and A.M. Gleason, “Combinatorial relations and chromatic graphs”, Canad. J. Math. 7 (1955), 1–7.
Article MathSciNet Google Scholar
F. Harary, Graph Theory, Addison-Wesley, Reading, Mass., 1969.
MATH Google Scholar
F. P. Ramsey, “On a problem of formal logic”, Proc. London Math. Soc. 30 (1930) 264–286.
Article MathSciNet MATH Google Scholar
C.C. Rousseau and J. Sheehan, “On Ramsey numbers for books”, J.G.T. 2 (1) (1978), 77–87.
Article MathSciNet MATH Google Scholar
C.C. Rousseau and J. Sheehan, “A class of Ramsey problems involving trees”, J. London Math. Soc. (2), 18 (1978), 392–396.
Article MathSciNet MATH Google Scholar
A. G. Thomason, Ph.D. Thesis, Cambridge University, 1979.
Google Scholar

Download references

Author information

Authors and Affiliations

Department of Mathematics, University of Aberdeen, Dunbar Street, AB9 2TY, Aberdeen, Scotland
John Sheehan

Authors

John Sheehan
View author publications
You can also search for this author in PubMed Google Scholar

Editor information

Kevin L. McAvaney

Rights and permissions

Reprints and permissions

Copyright information

About this paper

Cite this paper

Sheehan, J. (1981). Finite Ramsey theory is hard. In: McAvaney, K.L. (eds) Combinatorial Mathematics VIII. Lecture Notes in Mathematics, vol 884. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0091811

Download citation

DOI: https://doi.org/10.1007/BFb0091811
Published: 07 October 2006
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-10883-2
Online ISBN: 978-3-540-38792-3
eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Finite Ramsey theory is hard

Access this chapter

Preview

References