|
|
Kolmogorov seminar on computational complexity and descriptive complexity
March 11, 2013 16:45–18:25, Moscow
|
 |
|
 |
|
|
|
Дистанционные графы и приложение к одной задаче рамсеевского типа
A. B. Kupavskii |
| Number of views: |
| This page: | 188 |
|
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.
|
|
Contact us: