演講公告

演講主題：The Random Graph (CMMSC and NCTS Joint Seminar on Discrete Mathematics) 已取消!
主講人：Professor Peter J. Cameron (Queen Mary, University of London)
演講日期：2010年12月24、31日(兩次星期五) 下午1：30 ~ 3：20
演講地點：科學一館223室
茶會時間：下午3：30 ~ 4：00, NCTU SA322
摘要內容：
In 1963, P. Erd}os and A. Renyi proved the remarkable result that, if a random countably in nite graph X is constructed by choosing edges independently with probability 1=2, then there is a graph R such that with probability 1, X is isomorphic to R. They gave a non-constructive existence proof, but the graph R was constructed explicitly by R. Rado the following year. The graph R and its automorphism group have many remarkable properties, some of which will be considered in the talk. In fact, the construction of R is a special case of an earlier and more general construction by Frasse in the 1950s, which gives many structures with similar properties, such as a generic partially ordered set. An even earlier construction along the lines was that of a celebrated universal Polish space (separable metric space) by P. S. Urysohn in a posthumous paper in 1927, three years after his untimely death at the age of 26.
相關檔案：1212Cameron.pdf

$返回$ go back