BEGIN:VCALENDAR
VERSION:2.0
CALSCALE:GREGORIAN
PRODID:iCalendar-Ruby
BEGIN:VEVENT
CATEGORIES:Lecture / Talk / Workshop
DESCRIPTION:Lynn Scow\, CSU San Bernardino\n\n\nTitle: What is the minimum
number of colors needed to solve our puzzle?\n\n\nAbstract: A "graph'' is a
collection of two kinds of objects which we call "points'' and "edges.''
An edge is a connection between two points\, which we can represent by draw
ing a line segment between the two points. For example\, we could define o
ne point for each student committee on your campus\, and then decide that t
wo committees are "connected'' if there is a student who sits on both commi
ttees. Now\, suppose we are trying to schedule committee meetings using as
few hour-long time slots as possible. We could phrase this problem as req
uiring a coloring of the points (red\, blue\, green...) such that connected
points receive different colors (where each color represents a time slot).
\n\nIn this talk\, I will bring up a few abstract graph-coloring puzzles su
ch as this. Tools from logic can be helpful to analyze these puzzles. Som
e of the puzzles we will solve together\, and some will be left to you!
DTEND:20240419T213000Z
DTSTAMP:20240612T210014Z
DTSTART:20240419T203000Z
GEO:34.022409;-118.291027
LOCATION:Kaprielian Hall (KAP)\, 245
SEQUENCE:0
SUMMARY:Charlotte's Web: What is the minimum number of colors needed to sol
ve our puzzle?
UID:tag:localist.com\,2008:EventInstance_46138504596349
URL:https://calendar.usc.edu/event/charlottes-web-what-is-the-minimum-numbe
r-of-colors-needed-to-solve-our-puzzle
END:VEVENT
END:VCALENDAR