Department of Computer Science | Institute of Theoretical Computer Science | CADMO

Prof. Emo Welzl and Prof. Bernd Gärtner

Mittagsseminar Talk Information |

**Date and Time**: Tuesday, February 10, 2004, 12:15 pm

**Duration**: This information is not available in the database

**Location**: This information is not available in the database

**Speaker**: Robert Berke

Turan's famous theorem asserts that adding an edge to an r-colorable graph
G with the maximum number of edges (w.r.t its r-colorability) forces not
only to use r+1 colors in a proper coloring but also introduces a K_{r+1}
as a subgraph of it. This fact gives rise to the following property on
graphs:

A graph G satisfies the Turan Property, if for every induced subgraph G'
of G, and every integer r>0, the maximum number of edges in a K_{r+1}-free
subgraph of G' is equal to the maximum number of edges in an r-colorable
subgraph of it.

We will motivate the definition of the Turan Property, show its relation to perfect graphs and prove that line graphs of bipartite graphs satisfy the Turan Property. The results presented in this talk are taken from "Problems and results in Extremal Combinatorics - II" by Noga Alon.

Upcoming talks | All previous talks | Talks by speaker | Upcoming talks in iCal format (beta version!)

Previous talks by year: 2019 2018 2017 2016 2015 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2004 2003 2002 2001 2000 1999 1998 1997 1996

Information for students and suggested topics for student talks

Automatic MiSe System Software Version 1.4803M | admin login