Abstract
By a (d, n)-network we shall mean a oriented graph with n numbered vertices α 1, α 2, ..., α n and dn marked edges such that precisely d edges are incident to each vertex and one of them is marked by the weight x 1, another by the weight x 2, etc., and finally the last one by the weight x d .
Problemy Kibernetiki, 1967, N19, p. 261–268.
At the beginning of the sixties A. N. Kolmogorov proved Theorem 1 for nets with bounded branching and also the following approximation to Theorem 2: there exists a net with n > 1 elements any realization of which has diameter greater than \(C\sqrt n /\log n\), where C is a certain constant not depending on n. The final versions of the theorems given here belong to Ya. M. Barzdin. Author’s note.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
Editor information
Rights and permissions
Copyright information
© 1993 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Barzdin, Y.M. (1993). On the Realization of Networks in Three-Dimensional Space. In: Shiryayev, A.N. (eds) Selected Works of A. N. Kolmogorov. Mathematics and Its Applications, vol 27. Springer, Dordrecht. https://doi.org/10.1007/978-94-017-2973-4_11
Download citation
DOI: https://doi.org/10.1007/978-94-017-2973-4_11
Publisher Name: Springer, Dordrecht
Print ISBN: 978-90-481-8456-9
Online ISBN: 978-94-017-2973-4
eBook Packages: Springer Book Archive