Department of Computer Science | Institute of Theoretical Computer Science | CADMO
Prof. Emo Welzl and Prof. Bernd Gärtner
Mittagsseminar Talk Information |
Date and Time: Thursday, April 24, 2014, 12:15 pm
Duration: 30 minutes
Location: OAT S15/S16/S17
Speaker: Rajko Nenadov
In the first part of the talk we introduce several Ramsey-type questions and study their relations. In the second part of the talk we provide a general framework for studying such questions for random graphs. We then use it to determine the threshold for Anti-Ramsey properties of random graphs (extending a result of Bohman, Frieze, Pikhurko and Smyth) with respect to any graph which contains a cycle and the threshold for a different version of the Anti-Ramsey property, introduced by Kohayakawa, with respect to cycles of length at least 7.
Joint work with Angelika Steger and Nemanja Skoric.
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