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, March 07, 2006, 12:15 pm

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

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

**Speaker**: Konstantinos Panagiotou

For a graph G, let ET(G) denote the maximum number of edges in a triangle-free subgraph (not necessarily induced) of G, and let EB(G) be the maximum number of edges in a bipartite subgraph of G.

Of course, we always have ET(G) ≥ EB(G), but the general intuition -- guided by various known results -- suggests that, for dense enough graphs, these two parameters will typically be equal.

In 1990, Babai, Simonovits and Spencer studied these parameters for random graphs G(n,p) and confirmed this intuition for dense graphs. In particular, they proved that there is a (small) positive constant c such that, for p ≥ 1/2 - c, with high probability we have ET(G(n,p)) = EB(G(n,p)).

Babai, Simonovits and Spencer asked whether this result could be extended to
cover all constant values of p. In this talk we answer this question
affirmatively and show that the above property in fact holds whenever
p=p(n) ≥ n^{-c}, for some fixed c > 0.

This is joint work with Graham Brightwell and Angelika Steger.

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

Previous talks by year: 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