Abstract:
The definition of reducihility of a connected diagram is introduced, which makes
it possible to extend the definition of reducibility of a diagram [1] to the $n>4$,
and also to formulate the definition of dressed $n$-tail vertex with $n$ arbitrarily large.
Some theorems about topological properties of diagrams with vertices of arbitrarily
high order are proved.
Fulltext:
PDF file (987 kB)
