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, December 05, 2017, 12:15 pm

Duration: 45 minutes

Location: OAT S15/S16/S17

Speaker: Aleksandr Efremov

Homomorphisms Are a Good Basis for Counting Small Subgraphs

We will present how the problem of counting subgraphs can be reduced to the problem of counting homomorphisms. Based on that, we will show how to count subgraph copies of k-edge pattern in n-vertex host in time $k^{O(k)} \cdot n^{0.174k + o(k)}$. Relations between counting subraphs, induced subgraphs and homomorphisms and complexity of these problems will be discussed. Main part of the talk is based on the results of the paper by Curticapean, Dell, Marx from 2017.

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