Show The Graduate Center Menu

Colloquia & Seminars


  • New York Combinatorics Seminar This seminar covers a wide range of topics in combinatorics and its applications. 11:45 am CUNY GC Room 4419
  •  Our speaker is Aihua Li  from Montclair State University, and title is Zero divisor graphs of upper triangular matrix rings​, Abstract
  • We will discuss the maximum number of crossing-free straight-edge spanning cycles (also known as Hamiltonian tours, and as simple polygonizations) that can be embedded over a set of N points in the plane. We derive an improved upper bound for this number by relying on Kasteleyn's linear algebra technique.

  • The Computer Science Colloquium: The Computer Science Colloquium is a weekly event unifying Computer Scientists from CUNY and from the New York City area. This highly selective Colloquium features outstanding speakers in all fields of Computer Science as well as from influential governmental and corporate institutions. The Colloquium is supported by generous contributions from the Bloomberg, Information Builders, Inc., and Netlogic, Inc.

  • New York Logic Colloquium The New York Logic Colloquium is an interdisciplinary, regularly scheduled event in Logic unifying logicians in the New York City area. The highly selective colloquium features outstanding speakers in all fields of logic: Philosophy, Mathematics, and Computer Science.


  • Extremal cop-win graphs:(Fridays at 11:45 am at CUNY GC (365 Fifth Avenue) Room 4419)
    The game of cops and robber is a two player game, played on a graph, between a cop and a robber. First the cop chooses a vertex, then the robber chooses a vertex; then play alternates. On a turn, a player may move to an adjacent vertex or remain still. A graph is cop-win if the cop can guarantee a win. For a cop-win graph, the capture time is the number of moves required by one cop to catch the robber. We consider graphs that are extremal (or almost extremal) with respect to capture time, i.e. their capture time is as large as possible relative to their order. We reprove an old result characterizing such extremal graphs (our proof avoids the use of a computer search) and prove a new result, characterizing almost extremal graphs. Our new approach involves associating graphs to vectors (i.e. finite lists of integers) and then partially determining which vectors can be realized by some graph. We leave fully characterizing these vectors as an open question. This is joint work with David Offner.
    More details are available on the seminar webpage:
    Start: Dec 8, 2017
    Speaker:  Kerry Ojakian (BCC, CUNY)

  • CUNY NLP: Computational Linguistics and Natural Language Processing Seminar at CUNY The aim of the seminar is to invite talented researchers to give talks about state-of-the-art research in the field and stimulate collaboration opportunities. If you want to meet with any speaker individually after the talk, please send an e-mail to the host.

  • Seminar in Logic and Games This is the weekly seminar of the Knowledge, Games and Beliefs Group (KGB). The main interests of the group are Social Software, Formal Models of Knowledge and Belief, Belief Revision and Merging.

  • Initiative for the Theoretical Sciences The Initiative for the Theoretical Sciences (ITS @ the Graduate Center) provides a home for theoretical research in the sciences, cutting across a wide range of subjects but unified by the search for a mathematical description of the world around us. Throughout the semester we will hear from dozens of visitors, coming from around the world, including both distinguished senior scientists and rising young stars.
  • The GC Cryptography Student Seminar This is the weekly meeting to discuss mathematical aspects of cryptography.

    When: Every Friday 1:00 pm - 3:00 pm
    Where:  CUNY Graduate Center, Room 4421
    External page URL:
    Organizer(s):  Professor Dr. Delaram Kahrobaei (faculty adviser)
    Contact URL: