This is a progress report on a very dynamic branch of graph theory. We begin with a historical review of the origins of generalized ramsey theory and then indicate the small graphs for which the diagonal ramsey numbers are now known. The ramsey multiplicity of a graph is taken up and applied to ramsey games. We conclude with a listing of those families of graphs for which the ramsey numbers have been determined. There still does not exist any general powerful method for computing ramsey numbers.