DIMACS Discrete Mathematics Seminar

Title:

Ramsey graphs, old problems and a new result of Shelah

Speaker:

Dr. Andras Hajnal

DIMACS

Place:

CoRE Building, Room 431

Busch Campus, Rutgers University

Time:

4:30 PM

Tuesday, October 31, 1995

Abstract:

Ramsey graphs are graphs of n vertices not containing complete and independent (stable) subsets of size C.log n. Erdos and Renyi conjectured more then 25 years ago that such graphs contain exponentially many pairwise non isomorphic subgraphs. Shelah proved this conjecture while visiting DIMACS. Background material and his proof will be presented.

Document last modified on October 4, 1995