RUS  ENG JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PERSONAL OFFICE
Forthcoming seminars
Seminar calendar
List of seminars
Archive by years
Register a seminar

Search
RSS
Forthcoming seminars





You may need the following programs to see the files








Colloquium of the Steklov Mathematical Institute of Russian Academy of Sciences
September 3, 2015 16:00, Moscow, Steklov Mathematical Institute of RAS, Conference Hall (8 Gubkina)
 


Extremal combinatorics and random graphs

A. M. Raigorodskii
Video records:
MP4 2,733.3 Mb
MP4 693.4 Mb

Number of views:
This page:954
Video files:347
Youtube Live:
Youtube Video:

A. M. Raigorodskii
Photo Gallery


Видео не загружается в Ваш браузер:
  1. Установите Adobe Flash Player    

  2. Проверьте с Вашим администратором, что из Вашей сети разрешены исходящие соединения на порт 8080
  3. Сообщите администратору портала о данной ошибке



Abstract: One of the classical assertions in extremal combinatorics is the Erdos-Ko-Rado theorem, which establishes the size of a largest family of pair-wise intersecting k-element subsets of an n-element set. In the talk, we will exhibit the history of the problems related to the theorem. We will show that these problems are in the real core of contemporary discrete analysis. We will stress its connections to coding theory, combinatorial geometry, algebraic topology. We will pay the greatest attention to a recent probabilistic interpretation of the problem — in terms of random graphs.

SHARE: VKontakte.ru FaceBook Twitter Mail.ru Livejournal Memori.ru
 
Contact us:
 Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2017