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, November 29, 2022, 12:15 pm

Duration: 30 minutes

Location: OAT S15/S16/S17

Speaker: Kalina Petrova

Minimum degree conditions for spanning linear hypertrees of bounded degree

In 1995, Komlos, Sarkozy, and Szemeredi pinned down the necessary and sufficient minimum degree conditions for a graph to contain all spanning trees of not-too-large degree. I will talk about generalizations of this result to directed graphs and hypergraphs, including a result from work in progress together with Yanitsa Pehova. Namely, we show that every 3-uniform hypergraph with minimum degree (5/9 + epsilon) n(n-1)/2 contains all linear spanning trees of constant maximum degree. I will also mention some interesting open problems along the way.

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