Prof. Emo Welzl and Prof. Bernd Gärtner
|Mittagsseminar Talk Information|
Date and Time: Wednesday, November 17, 2004, 12:15 pm
Duration: This information is not available in the database
Location: This information is not available in the database
Speaker: László Lovász (Microsoft Corporation and Eötvös Univ.)
We may want to measure the similarity of two graphs by the frequencies of small subgraphs, or by the densities of big induced subgraphs. It turns out that at least for dense graphs, these two ways are equivalent. There is a tight connection with Szemeredi's Lemma and quasirandom graphs.
Automatic MiSe System Software Version 1.4803M | admin login