| Mittagsseminar Talk Information | |
Date and Time: Thursday, August 21, 2008, 12:15 pm Duration: This information is not available in the database Location: CAB G51 Speaker: Philipp Zumstein Analytic Methods in Extremal Graph Theory
This talk discusses mainly two problems in extremal combinatorics where
analytical methods can be used:
(1) What is the minimum number of F-subgraphs in a graph G with n
vertices and a fraction of p edges? [supersaturated graphs]
(2) What is the minimum number of monochromatic copies of F in any
red/blue-coloring of the complete n-vertex graph? [Ramsey multiplicity]
It is of some special interest if the minimum number is equal to the
average number (attained by the random graph).
Most of this talk is based on work by A. F. Sidorenko.
Upcoming talks | All previous talks | Talks by speaker |  Upcoming talks in iCal format (beta version!) Previous talks by year: 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.3392 | admin login
|
