共查询到20条相似文献,搜索用时 15 毫秒
1.
《Topology and its Applications》2005,146(5-6):698-709
2.
J. Mederski 《Topology and its Applications》2009,156(13):2295-2305
In the paper we study fiberwise absolute neighborhood extensors with respect to some classes of metrizable spaces by means of the local extension properties and the lifting properties of the underlying spaces. 相似文献
3.
Sergey A. Antonyan 《Topology and its Applications》2011,158(2):141-151
We apply equivariant joins to give a new and more transparent proof of the following result: if G is a compact Hausdorff group and X a G-ANR (respectively, a G-AR), then for every closed normal subgroup H of G, the H-orbit space X/H is a G/H-ANR (respectively, a G/H-AR). In particular, X/G is an ANR (respectively, an AR). 相似文献
4.
Marcin Sawicki 《Topology and its Applications》2005,150(1-3):59-78
This paper deals with extending maps in asymptotic categories, i.e., in categories consisting of metric spaces and asymptotically Lipschitz coarsely proper maps. We demonstrate certain examples of absolute extensors and absolute neighborhood extensors. We give some conditions under which a version of Borsuk's homotopy extension theorem holds in these categories, and in answer to a problem posed by Dranishnikov in [Russian Math. Surveys 55 (2000) 1085] we show the failure of a general homotopy extension theorem. Finally, we show that a pair of an Hadamard space and its convex subspace has the homotopy extension property. 相似文献
5.
6.
We characterize metric spaces X whose hyperspaces X2 (or Bd(X)) of non-empty closed (bounded) subsets, endowed with the Hausdorff metric, are absolute [neighborhood] retracts. 相似文献
7.
8.
Ralph J. Faudree Ronald J. Gould Michael S. Jacobson Richard H. Schelp 《Journal of Graph Theory》1987,11(4):555-564
We examine several extremal problems for graphs satisfying the property |N(x) ∪ N(y)| ? s for every pair of nonadjacent vertices x, y ? V(G). In particular, values for s are found that ensure that the graph contains an s-matching, a 1-factor, a path of a specific length, or a cycle of a specific length. 相似文献
9.
Dirac proved that a graph G is hamiltonian if the minimum degree , where n is the order of G. Let G be a graph and . The neighborhood of A is for some . For any positive integer k, we show that every (2k ? 1)‐connected graph of order n ≥ 16k3 is hamiltonian if |N(A)| ≥ n/2 for every independent vertex set A of k vertices. The result contains a few known results as special cases. The case of k = 1 is the classic result of Dirac when n is large and the case of k = 2 is a result of Broersma, Van den Heuvel, and Veldman when n is large. For general k, this result improves a result of Chen and Liu. The lower bound 2k ? 1 on connectivity is best possible in general while the lower bound 16k3 for n is conjectured to be unnecessary. © 2006 Wiley Periodicals, Inc. J Graph Theory 53: 83–100, 2006 相似文献
10.
Partially supported by NSERC Grant A4000 and the Max Planck Institut für Mathematik 相似文献
11.
12.
Let be a countable and locally finite CW complex. Suppose that the class of all metrizable compacta of extension dimension contains a universal element which is an absolute extensor in dimension . Our main result shows that is quasi-finite.
13.
14.
15.
Kewen Zhao 《Monatshefte für Mathematik》2009,20(1):279-293
Let G be a simple graph with n vertices. For any v ? V(G){v \in V(G)} , let N(v)={u ? V(G): uv ? E(G)}{N(v)=\{u \in V(G): uv \in E(G)\}} , NC(G) = min{|N(u) èN(v)|: u, v ? V(G){NC(G)= \min \{|N(u) \cup N(v)|: u, v \in V(G)} and
uv \not ? E(G)}{uv \not \in E(G)\}} , and NC2(G) = min{|N(u) èN(v)|: u, v ? V(G){NC_2(G)= \min\{|N(u) \cup N(v)|: u, v \in V(G)} and u and v has distance 2 in E(G)}. Let l ≥ 1 be an integer. A graph G on n ≥ l vertices is [l, n]-pan-connected if for any u, v ? V(G){u, v \in V(G)} , and any integer m with l ≤ m ≤ n, G has a (u, v)-path of length m. In 1998, Wei and Zhu (Graphs Combinatorics 14:263–274, 1998) proved that for a three-connected graph on n ≥ 7 vertices, if NC(G) ≥ n − δ(G) + 1, then G is [6, n]-pan-connected. They conjectured that such graphs should be [5, n]-pan-connected. In this paper, we prove that for a three-connected graph on n ≥ 7 vertices, if NC
2(G) ≥ n − δ(G) + 1, then G is [5, n]-pan-connected. Consequently, the conjecture of Wei and Zhu is proved as NC
2(G) ≥ NC(G). Furthermore, we show that the lower bound is best possible and characterize all 2-connected graphs with NC
2(G) ≥ n − δ(G) + 1 which are not [4, n]-pan-connected. 相似文献
16.
Kewen Zhao 《Monatshefte für Mathematik》2009,156(3):279-293
Let G be a simple graph with n vertices. For any , let , and , and and u and v has distance 2 in E(G)}. Let l ≥ 1 be an integer. A graph G on n ≥ l vertices is [l, n]-pan-connected if for any , and any integer m with l ≤ m ≤ n, G has a (u, v)-path of length m. In 1998, Wei and Zhu (Graphs Combinatorics 14:263–274, 1998) proved that for a three-connected graph on n ≥ 7 vertices, if NC(G) ≥ n − δ(G) + 1, then G is [6, n]-pan-connected. They conjectured that such graphs should be [5, n]-pan-connected. In this paper, we prove that for a three-connected graph on n ≥ 7 vertices, if NC
2(G) ≥ n − δ(G) + 1, then G is [5, n]-pan-connected. Consequently, the conjecture of Wei and Zhu is proved as NC
2(G) ≥ NC(G). Furthermore, we show that the lower bound is best possible and characterize all 2-connected graphs with NC
2(G) ≥ n − δ(G) + 1 which are not [4, n]-pan-connected.
相似文献
17.
Let k be a field of characteristic 0 and let [`(k)] \bar{k} be a fixed algebraic closure of k. Let X be a smooth geometrically integral k-variety; we set [`(X)] = X ×k[`(k)] \bar{X} = X{ \times_k}\bar{k} and denote by [`(X)] \bar{X} . In [BvH2] we defined the extended Picard complex of X as the complex of Gal( [`(k)]