Jagdeep Singh, Mississippi State University

Description

Combinatorics seminar
Speaker: Jagdeep Singh, Mississippi State University
Host: Niranjan Balachandran
Title: From Cographs to Comatroids: Forbidden Structures and Apex Classes
Time, day and date: 10:00:00 AM - 11:00:00 AM, Wednesday, March 25
Venue: Online (https://meet.google.com/pcb-jarm-pvq)
Abstract: Complement reducible graphs, or cographs, form one of the most well-understood hereditary classes of graphs: they admit linear-time recognition, possess multiple elegant characterizations, and have a simple forbidden subgraph description (no induced path of length three). In this talk, I will describe two natural generalizations of cographs: 2-cographs and sesquicographs. I will then present results showing that apexing (adding a single vertex or edge) preserves the finiteness of forbidden induced subgraphs, along with explicit bounds on their size. Finally, I will extend this framework from graphs to binary matroids, introducing comatroids as the natural matroid analogue of cographs. Analogous extension results hold in this setting. This work includes joint work with James Oxley, Thomas Zaslavsky and Vaidy Sivaraman.

Link for the talk: https://meet.google.com/pcb-jarm-pvq

Location
Online
URL
Date
Wed, March 25, 2026
Start Time
10:00am-11:00am IST
Duration
1 hour
Priority
5-Medium
Access
Public
Updated
Mon, March 23, 2026 8:06am IST