BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Faculty Commons - ECPv5.1.4//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:Faculty Commons
X-ORIGINAL-URL:https://facultycommons.citytech.cuny.edu
X-WR-CALDESC:Events for Faculty Commons
BEGIN:VTIMEZONE
TZID:America/New_York
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20150308T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20151101T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20151022T124500
DTEND;TZID=America/New_York:20151022T124500
DTSTAMP:20200715T025903
CREATED:20151015T211749Z
LAST-MODIFIED:20160304T202338Z
UID:2440-1445517900-1445517900@facultycommons.citytech.cuny.edu
SUMMARY:Mathematics and Physics Colloquium: Symmetric Class-0 Subgraphs and Forbidden Subgraphs
DESCRIPTION:[icon name=”map-marker” class=”” unprefixed_class=””] Place: Namm 720\n[icon name=”calendar” class=”” unprefixed_class=””] Date: Thursday October 22\, 2015 \n [icon name=”clock-o” class=”” unprefixed_class=””] Time: 12:45 p.m. \nPresented by Prof. Eugene Fiorini\nFaculty and students are welcome\, light refreshments will be served. \nAbstract:\nCompetition graphs and graph pebbling are two examples of graph theoretical-type games played on a graph under well-defined conditions. In the case of graph pebbling\, the pebbling number pi(G) of a graph G is the minimum number of pebbles necessary to guarantee that\, regardless of distribution of pebbles and regardless of the target vertex\, there exists a sequence of pebbling moves that results in placing a pebble on the target vertex. A class-0 graph is one in which the pebbling number is the order of the graph\, pi(G)=|V(G)|. This talk will consider under what conditions the edge set of a graph G can be partitioned into k class-0 subgraphs\, k a positive integer. Furthermore\, suppose D is a simple digraph with vetex set V(D) and edge set E(D). The competition graph G(V(G)\,E(G)) of D is defined as a graph with vertex set V(G)=V(D) and edge vw in E(G) if and only if for some vertex u in V\, there exist directed edges (u\,v) and (u\,w) in E(D). This talk will present some recent results on forbidden subgraphs of a family of competition graphs. \n[icon name=”file-pdf-o” class=””] Click to view poster. \n
URL:https://facultycommons.citytech.cuny.edu/event/mathematics-and-physics-colloquium-symmetric-class-0-subgraphs-and-forbidden-subgraphs/
LOCATION:N-720
CATEGORIES:Math Seminar,Physics Seminar
END:VEVENT
END:VCALENDAR