April 23, 202015.30 MSK (UTC +3)  
Brendan McKay with the talk "Complex Martingales and Regular Graphs" on the Big Seminar 

Joint work with Mikhail Isaev  
The asymptotic enumeration of regular graphs, and more generally of graphs with specified degree sequences, has occupied combinatorialists for a long time. We will start with a survey of previous results, with a quick summary of the methods used. Then we will focus on the application of complexanalytic methods to degree sequences that are sufficiently dense. Next we will show how a general theorem on complex martingales can be applied to the estimation of the necessary integrals. Then we will apply a theorem of Isaev on cumulant expansions to find an asymptotic expansion for the number of regular graphs of degree at least n^t for some t>0. Read more 
Lab events
Events archive:
Regular talks:
Lab events
Events archive:
Events archive:
December 18, 201917.00  
Lecture by Balázs Patkós "Turán problems with dergee conditions" 

Dolgoprudny MIPT Cifra 2.35  
Turán problems ask for the maximum number $ex(n,F)$ of edges that an $n$vertex graph $H$ can have without containing a copy of the forbidden graph $F$. These problems are the starting points of extremal graph theory and there have been an enormous amount of research in the area in the past century. There exist many generalizations and variants to this kind of problems. In my talk, I will survey some recently introduced notions and the first couple of results concerning these notions all of which involve the degrees of either all vertices of the graph $H$ or of all vertices of the copy of $F$ in $H$. Read more 
Related events
November 29 and December 2, 201917.00  18.30  
Two lectures by István Tomon "Intersection graphs of geometric objects" 

Dolgoprudny MIPT Arctica and Main building  
"In the past 60 years, graph theoretic properties of such intersection graphs are extensively studied both from a theoretical and a practical point of view. In this minicourse, I will survey some classical and recent results about Ramsey and coloring properties of geometric intersection graphs, along with numerous open problems." 
November 2628, 201916.00  17.00 / 17.00  18.00  
Minicourse by Gábor Tardos "Extremal theory of vertex and edgeordered graphs" 

Dolgoprudny MIPT Arctic building  
Prof. Gábor Tardos will give 3 lectures at MIPT in November 2019. The first and the second lecture will be part of the "Combinatorics and Geometry Days I" conference. On November 28 there will be the final lecture of the course from 17.00 to 18.00. All the lectures will take place in the lecture auditorium on the 4th floor of the Arctic building. "The basic question of Turan type extremal graph theory is the maximum number of edges in a simple graph on n vertices that does not contain a specified "forbidden" subgraph (or any one of several forbidden subgraphs). This is a classical topic of combinatorics with many deep results and lot of questions that are still open... 
Combinatorics and Geometry Days I
October 21, 201918.35  20.00  
Lecture by prof. Rom Pinchasi "Point sets in general position that determine lines with a small piercing set" 

Dolgoprudny MIPT Cifra 2.35  
Rom Pinchasi give the lecture in MIPT on October 21. Everyone is invited to attend the lecture course. The language of the lectures is English. The course is aimed at master and graduate students, as well as researchers in the field of combinatorics. 
October 1218, 2019  
Workshop "Open problems in combinatorics and geometry" 

Adygea Maykop  
... "During the first part of the workshop, we will concentrate on solving and discussing open problems suggested by the participants. During the last two days in Maikop, we will have some contributed talks and public lectures as part of the conference "Caucasus mathematical readings"... 
September 1620, 201913.55  15.20  
Minicourse by Prof. Ron Aharoni "Choice functions" 

Dolgoprudny MIPT Arctic building  
Ron Aharoni will give 3 lectures in the lecture auditorium on the 4th floor of the Arctic building. In this minicourse, he will introduce us to the multicolored analogues of some of the wellknown combinatorial theorems, as well as interesting open questions in the field and the topological and combinatorial basics necessary to obtain these results. 