******************** Event 1: Pre-semester Monday lecture ******************** On Monday, Oct 08, 2 pm, at TU Berlin, in room MA 041, Dan Kral will give the following talk. You are all cordially invited. Dan Kral (Brno): Step Sidorenko property and weakly norming graphs Abstract: There has recently been a lot of interplay between extremal graph theory and the theory of graph limits. After a brief survey of the theory of dense graph limits, we focus on exploring a link between Sidorenko's Conjecture, one of the most prominent open problems in extremal graph theory, and weakly norming graphs, one of the concepts studied in the theory of graph limits. Sidorenko's Conjecture asserts that every bipartite graph H has the Sidorenko property, i.e., a quasirandom graph minimizes the density of H among all graphs with the same edge density. We are interested in a stronger property, which we call the step Sidorenko property. We relate this property to weakly norming graphs and use our results to construct a bipartite edge-transitive graph that is not weakly norming - this answers a question of Hatami [Israel J. Math. 175 (2010), 125-150]. The talk is based on joint work with Taisa Martins, Peter Pal Pach and Marcin Wrochna. ******************** Event 2: Habilitation defense ******************** On the same day, Monday, Oct 08, at 10 am (sharp) in the morning, in room BEL 301 at TU Berlin (the small villa behind the math building), I will defend my habilitation thesis entitled: "Combinatorial algorithms". You are also cordially invited to attend. There will be a reception including drinks and food afterwards, starting at 12am in room MA 508.