The cutwidth and the vertex separation number of hypergraphs and their König’s representations

Articles in the same Issue

1. On the number of bases of the transportation problem with prohibitions
2. A local inversion of a finite automaton by an automaton
3. On the Simulation of growth of convex and tree-like configurations in homogeneous structures
4. A lower bound for cardinality of a class of cyclic difference families
5. The cutwidth and the vertex separation number of hypergraphs and their König’s representations
6. On the complexity of realization of the universal function by circuits of functional elements
7. On consistency of the maximum likelihood method in ranking the outcomes of the polynomial scheme according to their probabilities
8. On a scheme of Markov allocation of particles into groups of cells
9. The Poisson limit distribution of the number of empty cells in the generalized equiprobable scheme of allocating particles by groups