Department of Mathematics and Statistics, Binghamton University

User Tools

Site Tools

You are here: Homepage » Colloquium, Seminars, Lectures, and Conferences » Combinatorics Seminar » abstract.202004chu
seminars:comb:abstract.202004chu

Differences

This shows you the differences between two versions of the page.

Link to this comparison view

Both sides previous revisionPrevious revision
seminars:comb:abstract.202004chu [2020/05/18 02:29] – [Title:] zaslavseminars:comb:abstract.202004chu [2020/05/18 02:30] (current) – [Combinatorics Seminar,] zaslav
Line 1: Line 1:
 +======  ======
  
 +======  ======
 +
 +====== Speaker: Maria Chudnovsky (Princeton) ======
 +
 +====== Title: Recent Progress on the Erdos--Hajnal Conjecture ======
 +
 +===== Virtual Combinatorics Seminar, Tuesday, April 7, 2020 =====
 +
 + What is the effect of excluding an induced subgraph on the global structure of a graph? While there do not seem to be general structural consequences, a conjecture of Erdos and Hajnal states that graphs with forbidden induced subgraphs behave very differently from general graphs; more precisely, they contain much larger cliques or stable sets. This conjecture is still open. I will discuss the history of this problem and some recent theorems related to it.