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 02, 2021, 12:15 pm
Duration: 30 minutes
Location: Zoom: conference room
Speaker: Istvan Tomon
A curve is the image of a continuous function from [0,1] to the plane. We prove that every set of n curves contains either n^c members that are pairwise disjoint, or n^c members that are pairwise intersecting, where c>0 is an absolute constant. This resolves a conjecture of Alon, Pach, Pinchasi, Radoičić and Sharir, also reiterated by Fox and Pach. Interestingly, the methods developed for the resolution of this problem played a key role in the recent breakthrough in the Erdős-Hajnal conjecture by Chudnovsky, Scott, Seymour and Spirkl.
Upcoming talks | All previous talks | Talks by speaker | Upcoming talks in iCal format (beta version!)
Previous talks by year: 2025 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