Vaidy Sivaraman (University of Central Florida)

Description
Combinatorics Seminar

Speaker: Vaidy Sivaraman (University of Central Florida)
Venue: Ramanujan Hall
Date & Time: Monday 13th August, 4-5 PM.

Title: Detecting odd holes
Abstract: The complexity of determining whether a graph has an induced odd
cycle of length at least 5 (odd hole) is unknown. In this talk, I will
describe a polynomial-time algorithm to do this if the input graph does
not contain the bull (a particular 5-vertex graph that turns out to be
important in the theory of induced subgraphs) as an induced subgraph.
This is joint work with Maria Chudnovsky.
Description
Ramanujan Hall, Department of Mathematics
Date
Mon, August 13, 2018
Start Time
4:00pm-5:00pm IST
Duration
1 hour
Priority
5-Medium
Access
Public
Created by
DEFAULT ADMINISTRATOR
Updated
Sun, August 12, 2018 6:13pm IST