Abstract
A realization of graphs with vertices of bounded branching in a subspace of bounded depth is considered. A volume order inside of which an arbitrary graph can be realized is determined.
Similar content being viewed by others
References
A. N. Kolmogorov and Ya. M. Bardzin’, “Realization of Circuits in a Three-Dimensional Space,” in Problemy Kibernetiki (Nauka, Moscow, 1967), Vol. 19, pp. 261–268.
O. B. Lupanov, “Synthesis of Some Classes of Control Systems,” in Problemy Kibernetiki (Nauka, Moscow, 1963), Vol. 10, pp. 63–97.
N. A. Shkalikova, “Realization of Boolean Functions by Circuits of Cell Elements,” in Matem. Voprosy Kibernetiki (Nauka, Moscow, 1989), Vol. 2, pp. 177–197.
S. S. Kravtsov, “Realization of Boolean Functions in a Class of circuits of Functional and Switching Elements,” in Problemy Kibernetiki (Nauka, Moscow, 1967), Vol. 19, pp. 285–292.
Author information
Authors and Affiliations
Additional information
Original Russian Text © A.V. Chashkin, 2007, published in Vestnik Moskovskogo Universiteta, Matematika, Mekhanika, 2007, Vol. 62, No. 3, pp. 36–40.
About this article
Cite this article
Chashkin, A.V. Realization of graphs in a subspace of bounded height. Moscow Univ. Math. Bull. 62, 119–123 (2007). https://doi.org/10.3103/S0027132207030084
Received:
Issue Date:
DOI: https://doi.org/10.3103/S0027132207030084