BEGIN:VCALENDAR
VERSION:2.0
PRODID:-// - ECPv5.3.1//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-ORIGINAL-URL:https://aarms.math.ca
X-WR-CALDESC:Events for
BEGIN:VTIMEZONE
TZID:UTC
BEGIN:STANDARD
TZOFFSETFROM:+0000
TZOFFSETTO:+0000
TZNAME:UTC
DTSTART:20220101T000000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=UTC:20220406T153000
DTEND;TZID=UTC:20220406T163000
DTSTAMP:20230928T044334
CREATED:20220404T142531Z
LAST-MODIFIED:20220404T142531Z
UID:6637-1649259000-1649262600@aarms.math.ca
SUMMARY:Atlantic Graph Theory Seminar: John Engbers (Marquette University)
DESCRIPTION:Extremal questions for vertex colorings of graphs\n\nFor graphs $G$ and $H$\, an $H$-coloring of $G$ is a map from the vertices of $G$ to the vertices of $H$ so that an edge in $G$ is mapped to an edge in $H$. The graph $H$ can be thought of as the allowable coloring scheme: its vertices are the colors used and its edges indicating colors that can appear on the endpoints of an edge in $G$. When the graph $H$ is the complete graph $K_q$\, an $H$-coloring corresponds to a proper vertex coloring of $G$ with $q$ colors; when $H$ is an edge with one looped endvertex\, an $H$-coloring corresponds to an independent set in $G$.After familiarizing ourselves with the notion of an $H$-coloring\, we will consider the following extremal graph theory question: given a family of graphs and an $H$\, which graph in the family has the most number of $H$-colorings\, and which has the least number of $H$-colorings? We will discuss some things that are known (and not known!) in a variety of families\, including trees and graphs with a fixed minimum degree.\n\n\nJoin Zoom Meeting: link\n\n\n
URL:https://aarms.math.ca/event/atlantic-graph-theory-seminar-john-engbers-marquette-university/
LOCATION:Zoom seminar
CATEGORIES:AARMS Atlantic Graph Theory Seminar
ORGANIZER;CN="Jason%20Brown":MAILTO:jason.brown@dal.ca
END:VEVENT
END:VCALENDAR