A connected locally connected countable space which is almost regular
نویسندگان
چکیده
منابع مشابه
Countable Connected Spaces
Introduction, Let © be the class of all countable and connected perfectly separable Hausdorff spaces containing more than one point. I t is known that an ©-space cannot be regular or compact. Urysohn, using a complicated identification of points, has constructed the first example of an ©-space. Two ©-spaces, X and X*, more simply constructed and not involving identifications, are presented here...
متن کاملCountable connected-homogeneous graphs
A graph is connected-homogeneous if any isomorphism between finite connected induced subgraphs extends to an automorphism of the graph. In this paper we classify the countably infinite connectedhomogeneous graphs. We prove that if Γ is connected countably infinite and connected-homogeneous then Γ is isomorphic to one of: Lachlan and Woodrow’s ultrahomogeneous graphs; the generic bipartite graph...
متن کاملHamiltonian properties of almost locally connected claw-free graphs
A vertex v of a graph G is locally connected if the set of neighbors N(v) of v induces a connected subgraph in G. Let B(G) denote the set of vertices of G that are not locally connected. Then G is almost locally connected if B(G) is an independent set and for any x ∈ B(G), there is a vertex y in V (G) \ {x} such that N(x) ∪ {y} induces a connected subgraph of G. The main result of this paper is...
متن کاملHomogeneous Countable Connected Hausdorff Spaces
In 1925, P. Urysohn gave an example of a countable connected Hausdorff space [4]. Other examples have been contributed by R. Bing [l], M. Brown [2], and E. Hewitt [3]. Relatively few of the properties of such spaces have been examined. In this paper the question of homogeneity is studied. Theorem I shows that there exists a bihomogeneous countable connected Hausdorff space. Theorems II and III ...
متن کاملEvery 3-connected, locally connected, claw-free graph is Hamilton-connected
A graph G is locally connected if the subgraph induced by the neighbourhood of each vertex is connected. We prove that a locally connected graph G of order p 3, containing no induced subgraph isomorphic to K 1;3 , is Hamilton-connected if and only if G is 3-connected.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Colloquium Mathematicum
سال: 1982
ISSN: 0010-1354,1730-6302
DOI: 10.4064/cm-46-2-189-195