|
СЕМИНАРЫ |
Дискретная и вычислительная геометрия
|
|||
|
[Topology and combinatorics of “unavoidable complexes”] R. Živaljević |
|||
Аннотация: The general Tverberg–Van Kampen–Flores problem is to find higher dimensional analogues of results about non-planarity of graphs. More precisely, the problem is to find interesting examples of simplicial complexes which are For illustration, the graphs Язык доклада: английский |