The Loebl-Komlos-Sos conjecture
- Date
- Jan 8, 2015
- Time
- 1:15 PM - 2:15 PM
- Speaker
- Jan Hladky
- Affiliation
- Czech Academy of Sciences, Prague
- Language
- en
- Main Topic
- Mathematik
- Other Topics
- Mathematik
- Host
- Prof. Dr. M. Bodirsky / Prof. Dr. A. Thom
- Description
- Many problems in extremal graph theory fit in the following framework: Does a certain density condition imposed on a host graph guarantee the existence of a given subgraph? Perhaps the most famous example in this direction is Mantel's Theorem from 1907: If a graph on n vertices contains at more than n^2/4 edges, then it must contain a triangle. I will give further examples, explain the basic concepts of extremal graphs and stability, and show the role of the celebrated Szemeredi Regularity Lemma in proving similar results. I will then report on joint progress with Janos Komlos, Diana Piguet, Miklos Simonovits, Maya Stein, Endre Szemeredi on the Loebl-Komlos-Sos conjecture, an extremal problem about containment of trees, which has been open for two decades.
- Links
Last modified: Nov 27, 2014, 3:42:42 PM
Location
TUD Willers-Bau (WIL C 133)Zellescher Weg12-1401069Dresden
- Homepage
- https://navigator.tu-dresden.de/etplan/wil/00
Organizer
TUD MathematikWillersbau, Zellescher Weg12-1401069Dresden
- Phone
- 49-351-463 33376
- Homepage
- http://tu-dresden.de/mathematik
Scan this code with your smartphone and get directly this event in your calendar. Increase the image size by clicking on the QR-Code if you have problems to scan it.
Legend
- Biology
- Chemistry
- Civil Eng., Architecture
- Computer Science
- Economics
- Electrical and Computer Eng.
- Environmental Sciences
- for Pupils
- Law
- Linguistics, Literature and Culture
- Materials
- Mathematics
- Mechanical Engineering
- Medicine
- Physics
- Psychology
- Society, Philosophy, Education
- Spin-off/Transfer
- Traffic
- Training
- Welcome