|
СЕМИНАРЫ |
Дискретная и вычислительная геометрия
|
|||
|
On the signed number of circuits of even length in nonoriented graphs С. К. Ландо |
|||
Аннотация: A chord diagram is a one-face map. To a chord diagram, a simple graph can be associated, which is the intersection graph of the diagram. The chord diagram structure allows one to assign signs to circuits of even length in this graph in a natural way. The difference between the number of positive and negative circuits of given length The talk is based on a joint paper with E. Kulakova, T. Mukhutdinova and G. Rybnikov (2014). |