BEGIN:VCALENDAR
CALSCALE:GREGORIAN
PRODID:iCalendar-Ruby
VERSION:2.0
BEGIN:VEVENT
DESCRIPTION: Perfect graphs are important objects in graph theory. The per
fect graphs include many important families of graphs\, and serve to unify
results relating colorings and cliques in those families. One of the most
famous and most important results is the strong perfect graph theorem conje
ctured by Claude Berge and proved by Chudnovsky\, Robertson and Thomas. Thi
s theorem characterizes perfect graphs. Our interest is to give other char
acterizations of perfect graphs. In this talk\, we construct several latti
ce polytopes arising from a finite simple graph and characterize when the g
raph is perfect in terms of the lattice polytopes. This talk is based on j
oint work with Takayuki Hibi and Hidefumi Ohsugi.
DTSTAMP:20181016T152900
DTSTART:20181022T160000
CLASS:PUBLIC
LOCATION:Technische Universität Berlin\n Institut für Mathematik\n Straße d
es 17. Juni 136\n 10623 Berlin\n Room MA 041 (Ground Floor)
SEQUENCE:0
SUMMARY:Akiyoshi Tsuchiya (Osaka University): Polyhedral characterizations
of perfect graphs
UID:92313297@www.facetsofcomplexity.de
URL:http://www.facetsofcomplexity.de/monday/20181022-C-Tsuchiya.html
END:VEVENT
END:VCALENDAR