Department of Computer Science | Institute of Theoretical Computer Science | CADMO

Theory of Combinatorial Algorithms

Prof. Emo Welzl and Prof. Bernd Gärtner

Mittagsseminar (in cooperation with A. Steger, D. Steurer and B. Sudakov)

Mittagsseminar Talk Information

Date and Time: Tuesday, April 14, 2015, 12:15 pm

Duration: 30 minutes

Location: OAT S15/S16/S17

Speaker: Andreas Noever

A tight Erdős-Pósa function for long cycles

A family H of graphs is said to have the Erdős-Pósa property if there exists a function f: N -> N such that every graph G contains either k vertex-disjoint members of H or a set X of at most f(k) vertices such that G - X has no subgraph isomorphic to a graph in H. We show that, for every l, the family of circuits of length at least l satisfies the Erdős-Pósa property with f(k)=O(kl + k log k). This is optimal up to a constant factor. Joint work with Frank Mousset, Nemanja Skoric and Felix Weissenberger.

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