BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//talks.cam.ac.uk//v3//EN
BEGIN:VTIMEZONE
TZID:Europe/London
BEGIN:DAYLIGHT
TZOFFSETFROM:+0000
TZOFFSETTO:+0100
TZNAME:BST
DTSTART:19700329T010000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=-1SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0100
TZOFFSETTO:+0000
TZNAME:GMT
DTSTART:19701025T020000
RRULE:FREQ=YEARLY;BYMONTH=10;BYDAY=-1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
CATEGORIES:Combinatorics Seminar
SUMMARY:On Graphs Defined by Some Systems of Equations - F
elix Lazebnik (University of Delaware)
DTSTART;TZID=Europe/London:20141023T143000
DTEND;TZID=Europe/London:20141023T153000
UID:TALK54120AThttp://talks.cam.ac.uk
URL:http://talks.cam.ac.uk/talk/index/54120
DESCRIPTION:In this talk I will present a simple method for co
nstructing infinite families of graphs defined by
a class of systems of equations over commutative r
ings. The graphs in all such families possess som
e general\nproperties including regularity or bi-r
egularity\, existence of special vertex colorings\
, and existence of covering maps between every two
members of the same family (hence\, embedded spec
tra). Another general property is that nearly ever
y graph constructed in this manner edge-decomposes
either the complete\, or complete bipartite\, gra
ph which it spans.\n\nIn many instances\, speciali
zations of these constructions have proved useful
in various graph theory problems\, but especially
in many extremal problems which deal with cycles i
n graphs. I will explain motivations for these con
structions\, survey both old and new results\, and
state open questions.\n
LOCATION:MR12
CONTACT:Andrew Thomason
END:VEVENT
END:VCALENDAR