Related papers: Connected and/or topological group pd-examples

Every directed set is Tukey equivalent to (a) the family of all compact subsets, ordered by inclusion, of a (locally compact) space, to (b) a neighborhood filter, ordered by reverse inclusion, of a point (of a compact space, and of a…

Let $G$ be a nontrivial connected graph of order $n$ and let $k$ be an integer with $2\leq k\leq n$. For a set $S$ of $k$ vertices of $G$, let $\kappa (S)$ denote the maximum number $\ell$ of edge-disjoint trees $T_1,T_2,...,T_\ell$ in $G$…

Let $G$ be a nontrivial connected graph of order $n$ and $k$ an integer with $2\leq k\leq n$. For a set $S$ of $k$ vertices of $G$, let $\kappa (S)$ denote the maximum number $\ell$ of edge-disjoint trees $T_1,T_2,...,T_\ell$ in $G$ such…

A cubical polytope is a polytope with all its facets being combinatorially equivalent to cubes. We deal with the connectivity of the graphs of cubical polytopes. We first establish that, for any $d\ge 3$, the graph of a cubical $d$-polytope…

We introduce the set-self-Tietze property, an analogue of the self-Tietze property for upper semi-continuous set-valued functions. A topological space $X$ is self-Tietze, if for every closed $A \subseteq X$ and continuous function $f \colon…

The property of countable metacompactness of a topological space gets its importance from Dowker's 1951 theorem that the product of a normal space X with the unit interval is again normal iff X is countably metacompact. In a recent paper,…

With graphs considered as natural models for many network design problems, edge connectivity $\kappa'(G)$ and maximum number of edge-disjoint spanning trees $\tau(G)$ of a graph $G$ have been used as measures for reliability and strength in…

It is shown that a topological group G is topologically isomorphic to the isometry group of a (complete) metric space iff G coincides with its G-delta-closure in the Rajkov completion of G (resp. if G is Rajkov-complete). It is also shown…

For a path connected, locally path connected and semilocally simply connected space $X$, let $\Pi_1(X)$ denote its topologised fundamental groupoid as established in the first article of this series. Let $\mathcal{E}$ be the category of…

We study the effect of edge contractions on simplicial homology because these contractions have turned to be useful in various applications involving topology. It was observed previously that contracting edges that satisfy the so called…

We prove an "abelian, locally compact" Whitehead theorem in fine shape: A fine shape morphism between locally connected finite-dimensional locally compact separable metrizable spaces with trivial $\pi_0$ and $\pi_1$ is a fine shape…

The power graph $\mathcal{P}(G)$ of a given finite group $G$ is the simple undirected graph whose vertices are the elements of $G$, in which two distinct vertices are adjacent if and only if one of them can be obtained as an integral power…

For a non-empty set $X$, the collection $Top(X)$ of all topologies on $X$ sits inside the Boolean lattice $\PP(\PP(X))$ (when ordered by set-theoretic inclusion) which in turn can be naturally identified with the Stone space $\px$. Via this…

We study when a piecewise full group (a.k.a. topological full group) of homeomorphisms of the Cantor space $X$ can be given a non-discrete totally disconnected locally compact (t.d.l.c.) topology and give a criterion for the alternating…

Let $G=(V,E)$ be a graph. A subset $S \subseteq V$ is a dominating set of $G$ if every vertex not in $S$ is adjacent to a vertex in $S$. A set $\tilde{D} \subseteq V$ of a graph $G=(V,E) $ is called an outer-connected dominating set for $G$…

By definition, the sharp packing index $\ind_P^\sharp(A)$ of a subset $A$ of an abelian group $G$ is the smallest cardinal $\kappa$ such that for any subset $B\subset G$ of size $|B|\ge\kappa$ the family $\{b+A:b\in B\}$ is not disjoint. We…

We study the minimum dominating set problem as a representative combinatorial optimization challenge with a global topological constraint. The requirement that the backbone induced by the vertices of a dominating set should be a connected…

Grohe and Marx proved that if G does not contain H as a topological minor, then there exist constants g=O(|V(H)|^4), D and t depending only on H such that G is a clique sum of graphs that either contain at most t vertices of degree greater…

Answering a question posed by S.Maillot in MathOverFlow, for every $n\in\mathbb N$ we construct a locally connected subgroup $G\subset\mathbb R^{n+1}$ of dimension $dim(G)=n$, which is not locally compact.

A $d$-dimensional tensegrity framework $(T,p)$ is an edge-labeled geometric graph in ${\mathbb R}^d$, which consists of a graph $T=(V,B\cup C\cup S)$ and a map $p:V\to {\mathbb R}^d$. The labels determine whether an edge $uv$ of $T$…