Related papers: On multivaled fixed-point free maps on R^n

We study a new variant of graph coloring by adding a connectivity constraint. A path in a vertex-colored graph is called conflict-free if there is a color that appears exactly once on its vertices. A connected graph $G$ is said to be…

In this paper, we introduce an extension of rectangular metric spaces called controlled rectangular metric spaces, by changing the rectangular inequality as follows: \begin{equation*} d(x, y)\leq\alpha(x, u)d(x, u)+\alpha(u, v)d(u,…

A colouring of a graph $G=(V,E)$ is a mapping $c\colon V\to \{1,2,\ldots\}$ such that $c(u)\neq c(v)$ for every two adjacent vertices $u$ and $v$ of $G$. The {\sc List $k$-Colouring} problem is to decide whether a graph $G=(V,E)$ with a…

We study the following question: how few edges can we delete from any $H$-free graph on $n$ vertices in order to make the resulting graph $k$-colorable? It turns out that various classical problems in extremal graph theory are special cases…

Let {\Lambda}\subsetR^{n}\timesR^{m} and k be a positive integer. Let f:R^{n}\rightarrowR^{m} be a locally bounded map such that for each ({\xi},{\eta})\in{\Lambda}, the derivatives D_{{\xi}}^{j}f(x):=|((d^{j})/(dt^{j}))f(x+t{\xi})|_{t=0},…

We establish continuity mapping properties of the non-centered fractional maximal operator $M_{\beta}$ in the endpoint input space $W^{1,1}(\mathbb{R}^d)$ for $d \geq 2$ in the cases for which its boundedness is known. More precisely, we…

We show that anagram-free vertex colouring a $2\times n$ square grid requires a number of colours that increases with $n$. This answers an open question in Wilson's thesis and shows that even graphs of pathwidth $2$ do not have anagram-free…

We study Hamiltonian diffeomorphisms on symplectic Euclidean spaces that are equal to non-degenerate linear maps at infinity. Under the assumption that there exists an isolated homologically nontrivial fixed point satisfying the twist…

In this paper we disprove the following conjectured generalization of the Contraction Mapping Theorem (due to J.D. Stein Jr.): Let X be a complete metric space and let F be a finite family of self-maps of X. Suppose there is a postive…

Following Chaudhuri, Sankaranarayanan, and Vardi, we say that a function $f:[0,1] \to [0,1]$ is $r$-regular if there is a B\"{u}chi automaton that accepts precisely the set of base $r \in \mathbb{N}$ representations of elements of the graph…

An edge-colored graph $G$ is conflict-free connected if any two of its vertices are connected by a path which contains a color used on exactly one of its edges. The conflict-free connection number of a connected graph $G$, denoted by…

Let \phi((x_1,...,x_n),(y_1,...,y_n))=(x_1-y_1)^2+...+(x_n-y_n)^2. We say that f:R^n -> C^n preserves distance d>=0 if for each x,y \in R^n \phi(x,y)=d^2 implies \phi(f(x),f(y))=d^2. We prove that if x,y \in R^n (n>=3) and…

In this paper we present proofs of basic results, including those developed so far by H. Bell, for the plane fixed point problem. Some of these results had been announced much earlier by Bell but without accessible proofs. We define the…

This paper considers synchronous discrete-time dynamical systems on graphs based on the threshold model. It is well known that after a finite number of rounds these systems either reach a fixed point or enter a 2-cycle. The problem of…

A proper vertex-coloring of a graph is $r$-dynamic if the neighbors of each vertex $v$ receive at least $\min(r, \mathrm{deg}(v))$ different colors. In this note, we prove that if $G$ has a strong $2$-coloring number at most $k$, then $G$…

A rational map $f:\widehat{\mathbb{C}}\to\widehat{\mathbb{C}}$ on the Riemann sphere $\widehat{\mathbb{C}}$ is called critically fixed if each critical point of $f$ is fixed under $f$. In this article, we study the properties of a…

We show that if a planar graph $G$ has a plane straight-line drawing in which a subset $S$ of its vertices are collinear, then for any set of points, $X$, in the plane with $|X|=|S|$, there is a plane straight-line drawing of $G$ in which…

Let $k>1$, and let $\mathcal{F}$ be a family of $2n+k-3$ non-empty sets of edges in a bipartite graph. If the union of every $k$ members of $\mathcal{F}$ contains a matching of size $n$, then there exists an $\mathcal{F}$-rainbow matching…

We study the problem of \emph{robust satisfiability} of systems of nonlinear equations, namely, whether for a given continuous function $f:\,K\to\mathbb{R}^n$ on a~finite simplicial complex $K$ and $\alpha>0$, it holds that each function…

Let G be a planar graph with a list assignment L. Suppose a preferred color is given for some of the vertices. We prove that if G is triangle-free and all lists have size at least four, then there exists an L-coloring respecting at least a…