BEGIN:VCALENDAR
CALSCALE:GREGORIAN
PRODID:iCalendar-Ruby
VERSION:2.0
BEGIN:VEVENT
DESCRIPTION: Trivially\, the maximum chromatic number of a graph on n ver
tices is n \, and the only graph which achieves this value is the complete
graph K _ n . It is natural to ask whether this result is "stable"\,
i.e.\, if n is large\, G has n vertices and the chromatic number o
f G is close to n \, must G be close to being a complete graph? It is
easy to see that for each c>\;0\, if G has n vertices and chromatic
number at least n − c \, then it contains a clique whose size is at least
n −2 c . We will consider the analogous questions for posets and dimen
sion. Now the discussion will really become interesting.
DTSTAMP:20190521T170500
DTSTART:20190527T141500
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:William T. Trotter ( Georgia Institute of Technology): Stability An
alysis for Posets
UID:95690867@www.facetsofcomplexity.de
URL:http://www.facetsofcomplexity.de/monday/20190527-L-Trotter.html
END:VEVENT
END:VCALENDAR