Friday November 7, 2025

Sponsored by 

The Metropolitan New York Section of the Mathematical Association of America

and hosted by the Montclair State University.

Graph Theory Day is held at different locations in and around New York City. 
Our goal is to provide a learning and sharing experience on recent developments.
Please encourage your students to attend and present a poster.

Location: Montclair State University, Building and Room TBA

Registration:  There is no registration fee. However, please register online by Nov 2, 2025 by filling this Registration Form. If you forget to register please come anyway. There may not be lunch for you, but your participation will be welcomed.

Schedule (in Eastern Time ET)

10:30 am: Welcome and Registration

11:00 - 12:00: Garth Isaak (Lehigh University)

12:00 - 2:00 pm: Lunch and Poster Session

2:00 pm - 3:00 pm: Katie Haymaker (Villanova University)

_________________________________________

Abstracts

Garth Isaak (Lehigh University)

Title: Enumerating List Colorings

Abstract: The chromatic polynomial for enumerating graph colorings has a long history. We will examine how to extend these ideas to  a polynomial for enumerating graph list colorings. We will have a polynomial that depends only on the graph, with evaluation depending on the sizes of intersections of the lists to count the number of list colorings. In particular we will see how three approaches to the classic chromatic polynomial; deletion-contraction, inclusion-exclusion and Mobius inversion can each  be extended to the list coloring setting. Along the way we also get to explore some interesting history related to the classic chromatic polynomial.

Katie Haymaker (Villanova University)

Title: Graph-based error-correcting codes and applications

 Abstract: Coding theory is the study of mathematical structures that can be used for error detection and correction. Linear codes over finite fields are used to store or send information reliably. Gallager introduced the idea of graph-based codes in his 1963 thesis on low-density parity-check codes. In this talk we will trace the history of these revolutionary codes and their notable descendants, including spatially coupled codes and codes from graph lifts.

_________________________________________

Poster Session (12:00 - 2:00 pm)

There is a place to upload poster title and abstract on the registration form.  If you have any questions about the poster session, please email Sandra Kingan (skingan@brooklyn.cuny.edu).

Local Organizing Committee: Deepak Bal, Jonathan Cutler, Aihua Li

Graph Theory Day Steering Committee: Deepak Bal, Nadia Benakli, Jonathan Cutler, Ezra Halleck, Nathan Kahl, Sandra Kingan, Kerry Ojakian, Eric Ramos, Abigail Raz, John Saccoman, and Mingxian Zhong.