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: Wednesday, August 14, 2013, 12:15 pm

Duration: 30 minutes

Location: OAT S15/S16/S17

Speaker: Mathias Schacht (Universität Hamburg)

On the structure of dense graphs with small clique number

We are interested in structural properties of large and dense graphs G=(V,E) that do not contain a copy of a fixed small graph F. In this talk F will be a small clique, *density* will be given a condition on the minimum degree of G, and *structural properties* are captured by studying homomorphic images of G. In particular, we give an alternative proof of a recent result of Goddard and Lyle, which determines the infimum over all α>0 such that every Kt-free graph G with minimum degree bigger than α|V(G)| has a Kt-free, homomorphic image of order at most K=K(α).

This is joint work with Heiner Oberkampf.

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