| RUS ENG |
| Full version |
|
|
|
| SEMINARS |
|
Kolmogorov seminar on computational complexity and descriptive complexity
|
|||
|
|
|||
|
Дистанционные графы и приложение к одной задаче рамсеевского типа A. B. Kupavskii |
|||
|
Abstract: We will discuss two common definitions of distance graphs and focus on their differences. We will show the asymptotic for the logarithm of the number of distance graphs in spaces of fixed dimension. These results are applied for the distance Ramsey number. |
|||