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 11, 2003, 12:15 pm
Duration: This information is not available in the database
Location: This information is not available in the database
Speaker: Michael Krivelevich (Tel Aviv University)
In this talk I will describe several recent results about the maximum possible number of edges in graphs with a given number of vertices that contain no copy of a given bipartite graph (the so called Turan numbers). The results are proven applying (some variations of) a simple yet amazingly powerful double counting-type argument, which has been used by several researchers, including Rodl, Kostochka, Gowers and Sudakov.
Joint work with Noga Alon and Benny Sudakov.
Upcoming talks | All previous talks | Talks by speaker | Upcoming talks in iCal format (beta version!)
Previous talks by year: 2024 2023 2022 2021 2020 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