Home /  MsriUp /  Schedules /  Chromatic polynomials of signed Petersen graphs

Chromatic polynomials of signed Petersen graphs

MSRI-UP 2012: Enumerative Combinatorics June 16, 2012 - July 29, 2012

July 29, 2012 (02:00 PM PDT - 03:00 PM PDT)
Speaker(s): Erika Meza, Bryan Nevarez, Alana Shine
Location: SLMath: Baker Board Room



T. Zaslavsky proved that there are essentially six signed versions of the famous Petersen graph. (Look here for an introduction to signed graphs.) He conjectures that they all have different chromatic polynomials. We will try to compute the latter, e.g., using A. Van Herick's IOP software.

Supplements No Notes/Supplements Uploaded
Video/Audio Files


H.264 Video msriup201214pm.m4v 148 MB video/mp4 rtsp://videos.msri.org/msriup201214pm/msriup201214pm.m4v Download
Quicktime msriup201214pm.mov 216 MB video/quicktime rtsp://videos.msri.org/msriup201214pm/msriup201214pm.mov Download
Troubles with video?

Please report video problems to itsupport@slmath.org.

See more of our Streaming videos on our main VMath Videos page.