By introducing the notions of L-spaces and L_r-spaces, a complete generalization of Kalton's closed graph theorem is obtained. It points out the class of L_r-spaces is the maximal class of range spaces for the clo...By introducing the notions of L-spaces and L_r-spaces, a complete generalization of Kalton's closed graph theorem is obtained. It points out the class of L_r-spaces is the maximal class of range spaces for the closed graph theorem when the class of domain spaces is the class of Mackey spaces with weakly * sequentially complete dual.Some examples are constructed showing that the class of L_r-spaces is strictly larger than the class of separable B_r-complete spaces.Some properties of L-spaces and L_r-spaces are discussed and the relations between B-complete (resp. B_r-complete) spaces and L-spaces (resp. L_r-spaces) are given.展开更多
In the design of certain kinds of electronic circuits the following question arises:given a non-negative integer k, what graphs admit of a plane embedding such that every edge is a broken lineformed by horizontal and ...In the design of certain kinds of electronic circuits the following question arises:given a non-negative integer k, what graphs admit of a plane embedding such that every edge is a broken lineformed by horizontal and vertical segments and having at mort k bends? Any such graph is said tobe k--rectilinear. No matter what k is, an obvious necessary condition for k-rectilinearity is that thedegree of each vertex does not exceed four.Our main result is that every planar graph H satisfying this condition is 3--rectilinear:in fact,it is 2--rectilinear with the only exception of the octahedron. We also outline a polynomial-timealgorithm which actually constructs a plane embedding of H with at most 2 bends (3 bends if H isthe octahedron) on each edge. The resulting embedding has the property that the total number ofbends does not exceed 2n, where n is the number of vertices of H.展开更多
文摘By introducing the notions of L-spaces and L_r-spaces, a complete generalization of Kalton's closed graph theorem is obtained. It points out the class of L_r-spaces is the maximal class of range spaces for the closed graph theorem when the class of domain spaces is the class of Mackey spaces with weakly * sequentially complete dual.Some examples are constructed showing that the class of L_r-spaces is strictly larger than the class of separable B_r-complete spaces.Some properties of L-spaces and L_r-spaces are discussed and the relations between B-complete (resp. B_r-complete) spaces and L-spaces (resp. L_r-spaces) are given.
文摘In the design of certain kinds of electronic circuits the following question arises:given a non-negative integer k, what graphs admit of a plane embedding such that every edge is a broken lineformed by horizontal and vertical segments and having at mort k bends? Any such graph is said tobe k--rectilinear. No matter what k is, an obvious necessary condition for k-rectilinearity is that thedegree of each vertex does not exceed four.Our main result is that every planar graph H satisfying this condition is 3--rectilinear:in fact,it is 2--rectilinear with the only exception of the octahedron. We also outline a polynomial-timealgorithm which actually constructs a plane embedding of H with at most 2 bends (3 bends if H isthe octahedron) on each edge. The resulting embedding has the property that the total number ofbends does not exceed 2n, where n is the number of vertices of H.