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

Let $\mathcal{C}_k(n)$ be the family of all connected $k$-chromatic graphs of order $n$. Given a natural number $x\geq k$, we consider the problem of finding the maximum number of $x$-colorings among graphs in $\mathcal{C}_k(n)$. When…

A stability result due to Ren, Wang, Wang and Yang [SIAM J. Discrete Math. 38 (2024)] shows that if $3\le r \le 2k$ and $n\ge 318 (r-2)^2k$, and $G$ is a $C_{2k+1}$-free graph on $n$ vertices with $e(G)\ge \lfloor {(n-r+1)^2}/{4}\rfloor +{r…

A graph $G$ is called $C_{2k+1}$-free if it does not contain any cycle of length $2k+1$. In 1981, Haggkvist, Faudree and Schelp showed that every $n$-vertex triangle-free graph with more than $\frac{(n-1)^2}{4}+1$ edges is bipartite. In…

Given a parameter dependent fixed point equation $x = F(x,u)$, we derive an abstract compactness principle for the fixed point map $u \mapsto x^*(u)$ under the assumptions that (i) the fixed point equation can be solved by the contraction…

In their 1997 paper titled ``Fruit Salad", Gy\'{a}rf\'{a}s posed the following conjecture: there exists a constant $k$ such that if each path of a graph spans a $3$-colourable subgraph, then the graph is $k$-colourable. It is noted that…

For a disk $D$ in the plane $\mathbb R^2$ and a plane map $f$, we give several conditions on the restriction of $f$ to the boundary $\partial D$ of $D$ which imply the existence of a fixed point of $f$ in some specified domain in $D$. These…

Frei et al. [6] showed that the problem to decide whether a graph is stable with respect to some graph parameter under adding or removing either edges or vertices is $\Theta_2^{\text{P}}$-complete. They studied the common graph parameters…

We develop the Lefschetz fixed-point theory for noncompact manifolds of bounded geometry and uniformly continuous maps. Specifically, we define the uniform Lefschetz class $\mathscr{L}(f)$ of a uniformly continuous map $f\colon M\to M$ of a…

Starting from Sinclair's 1976 work {\it Automatic Continuity of Linear Operators}, Cambridge University Press, (1976), on automatic continuity of linear operators on Banach spaces, we prove that sequences of intertwining continuous linear…

A two-dimensional \emph{grid} is a set $\Gnm = [n]\times[m]$. A grid $\Gnm$ is \emph{$c$-colorable} if there is a function $\chi_{n,m}: \Gnm \to [c]$ such that there are no rectangles with all four corners the same color. We address the…

We prove that for any automorphism $\alpha$ of a free group F of finite rank, one can efficiently compute a basis of the fixed point subgroup Fix(\alpha).

A vertex-coloring of a hypergraph is conflict-free, if each edge contains a vertex whose color is not repeated on any other vertex of that edge. Let $f(r, \Delta)$ be the smallest integer $k$ such that each $r$-uniform hypergraph of maximum…

We show that for any continuous monotonic fixed-point free automorphism $f$ on a $\sigma$-compact subgroup $G\subset \mathbb R$ there exists a binary operation $+_f$ such that $\langle G, +_f\rangle$ is a topological group topologically…

We prove that a closed convex subset $C$ of a real Hilbert space $X$ has the fixed point property for $(c)$-mappings if and only if $C$ is bounded. Some convergence results about the iterations are obtained.

Motivated by the intermediate Lang conjectures on hyperbolicity and rational points, we prove new finiteness results for non-constant morphisms from a fixed variety to a fixed variety defined over a number field by applying Faltings's…

Since planar triangle-free graphs are 3-colourable, such a graph with n vertices has an independent set of size at least n/3. We prove that unless the graph contains a certain obstruction, its independence number is at least n/(3-epsilon)…

We consider the k-strong conflict-free coloring of a set of points on a line with respect to a family of intervals: Each point on the line must be assigned a color so that the coloring has to be conflict-free, in the sense that in every…

Let F be a continuous injective map from an open subset of R^n to R^n. Assume that, for infinitely many k>1, F induces a bijection between the rational points of denominator k in the domain and those in the image (the denominator of…

A 2-dimensional framework is a straight line realisation of a graph in the Euclidean plane. It is radically solvable if the set of vertex coordinates is contained in a radical extension of the field of rationals extended by the squared edge…

In this paper, we study the existence of common fixed points of family of multivalued mappings satisfying generalized F-contractive conditions in ordered metric spaces. These results establish some of the general common fixed point theorems…