Reflections on a Theme of Ulam

  • Ron GrahamEmail author
Part of the Problem Books in Mathematics book series (PBM)


The annual Southeastern International Conference on Graph Theory, Combinatorics, and Computing is among the longest-running combinatorics conferences in the U.S. Launched in 1970, it was originally held in alternate years at Louisiana State University in Baton Rouge, LA and at Florida Atlantic University (FAU) in Boca Raton, FL. However, it is now held exclusively each year at FAU under the dedicated leadership of the redoubtable Fred Hoffman. (In fact, the 48th annual Conference took place in March, 2017.) Among the many attractions of this meeting, besides the marvelous climate of Florida in March, is the laid back atmosphere that permeates the meeting environment. The beach is nearby, the tennis courts are active (and in the old days, no one could defeat Ernie Cockayne and Steve Hedetniemi), and everyone who wants to give a talk can. (Of course, this policy can result in an interesting variety of presentations!)


  1. 1.
    L. Babai, Graph isomorphism in quasipolynomial time. arXiv:1512.03547, 89 pp.Google Scholar
  2. 2.
    F.R.K. Chung, P. Erdős, On unavoidable graphs. Combinatorica 3, 167–176 (1983)MathSciNetCrossRefGoogle Scholar
  3. 3.
    F.R.K. Chung, P. Erdős, On unavoidable hypergraphs. J. Graph Theory 11, 251–263 (1987)MathSciNetCrossRefGoogle Scholar
  4. 4.
    F.R.K. Chung, P. Erdős, R.L. Graham, S.M. Ulam, F.F. Yao, Minimal decompositions of two graphs into pairwise isomorphic subgraphs. Congr. Numer. 23, 3–18 (1979). Proceedings of the Tenth Southeastern Conference on Combinatorics, Graph Theory, and ComputingGoogle Scholar
  5. 5.
    F.R.K. Chung, P. Erdős, R.L. Graham, Minimal decompositions of graphs into mutually isomorphic subgraphs. Combinatorica 11, 13–24 (1981)MathSciNetCrossRefGoogle Scholar
  6. 6.
    F.R.K. Chung, P. Erdős, R.L. Graham, Minimal decomposition of all graphs with equinumerous vertices and edges into mutually isomorphic subgraphs. Finite Infinite Sets 37, 181–222 (1981). Colloq. Math. Soc. Janos Bolyai Eger, HungaryGoogle Scholar
  7. 7.
    F.R.K. Chung, P. Erdős, R.L. Graham, Minimal decompositions of hypergraphs into mutually isomorphic subhypergraphs. J. Comb. Theory A 32, 241–251 (1982)MathSciNetCrossRefGoogle Scholar
  8. 8.
    R.L. Graham, A similarity measure for graphs – reflections on a theme of Ulam. Stanislaw Ulam 1909–1984. Los Alamos Sci. 15(Special Issue), 114–121 (1987)Google Scholar
  9. 9.
    D.E. Knuth, The Art of Computer Programming. Satisfiability, vol. 4, Fascicle 6 (Pearson, London, 2015), xiii+310 pp.Google Scholar
  10. 10.
    P. Turán, On the theory of graphs. Coll. Math. 3, 19–30 (1954)CrossRefGoogle Scholar
  11. 11.
    F.F. Yao, Graph 2-isomorphism is NP-complete. Inf. Process. Lett. 9, 68–72 (1979)MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2018

Authors and Affiliations

  1. 1.University of California, San DiegoLa JollaUSA

Personalised recommendations