New York Combinatorics Seminar

This seminar is sponsored by the CUNY Graduate Center's Math Department and Computer Science Department. It covers a wide range of topics in combinatorics and its applications.  Talks are posted on our YouTube channel https://youtube.com/@NYCombinatorics and catalogued on the page Previous Semesters.

Time: Fridays 12:00 pm:  1:00 pm ET (Eastern Time)
Location: The CUNY Graduate Center is located at 365 Fifth Avenue (at the corner of 34th Street), New York. It can be easily reached by subway using the B,D,F,N,Q,R, or 6 train.

Seminar Co-Organizers (alphabetically):  Kira Adaricheva (Hofstra University) Deepak Bal (Montclair State University) Nadia Benakli (City Tech) Jonathan Cutler (Montclair State) Ezra Halleck (City Tech), Sandra Kingan (Graduate Center & Brooklyn College), Joseph Malkevitch (Graduate Center & York College), Kerry Ojakian (BCC), Megan Owen (Graduate Center & Lehman College),  Jinyoung Park (New York University), Anna Pun (Graduate Center & Baruch College), Eric Ramos (Stevens Institute of Technology), (Abigail Raz (Cooper Union), Eric Rowland (Hofstra University), Mingxian Zhong (Graduate Center & Lehman College).

Lead Organizer:
2025 - 2026: Deepak Bal
2024 - 2025: Anna Pun
2011 - 2024: Sandra Kingan

FALL 2025 TALKS

Room for In-person talks: Graduate Center 9116

Zoom link: https://montclair.zoom.us/j/93937899930?pwd=t3CoLts4pfRXcmhpUsUI6fIys9nv0p.1
Meeting ID: 93937899930     Passcode nycs

Feb 6:  Sandra Kingan (Brooklyn College and The Graduate Center) (virtual)

Title:  Deletable edges in 3-connected graphs and their applications

Abstract: In this talk I will analyze 3-connected graphs that contain a fixed 3-connected graph 𝐻 as a minor, but in which no edge can be deleted while preserving 3-connectivity and an 𝐻-minor. Let G and H be simple 3-connected graph such that G has an H-minor.  An edge e in G is called H-deletable if G\e is 3-connected and has an H-minor.  If G has no H-deletable edge, then G can be reduced to H using three specific local operations.  This gives a framework for studying extremal graphs with no 𝐻-deletable edges and yields applications to excluded-minor questions. This talk is based on a paper that just appeared in Discrete Mathematics(https://doi.org/10.1016/j.disc.2026.114994)
 

Feb 13:  

Feb 20:  

Feb 27: John Byrne  

Mar 6: Alex Nowak 

Mar 13:  must be virtual 

Mar 20: must be virtual

Mar 27: New York Combinatorics Day

Please encourage your students to present posters in the poster session.

Apr 3: must be virtual

Apr 10:  must be virtual

Apr 17: Emilio Minichiello

Apr 24: Athar Abdul-Quader

May 1: 

_________________________________________________________

Previous Speakers:
Fall 2025
Spring 2025
Fall 2024
Spring 2024
Fall 2023
Spring 2023
Fall 2022
Spring 2022
Fall 2021
Spring 2021
Fall 2020
Spring 2020
Fall 2019
Spring 2019
Fall 2018
Spring and Summer 2018
Fall 2017
Spring 2017
Fall 2016
Spring 2016
Fall 2015
Spring 2015
Fall 2014
Spring 2014
Fall 2013
Spring 2013
Fall 2012
Spring 2012
Fall 2011
Spring 2011
Previous Talks hosted by Janos Pach

Previous Organizers:
Christopher Hanusa (2011 - 2015)