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

We describe the endomorphisms of the direct product of two free groups of finite rank and obtain conditions for which the subgroup of fixed points is finitely generated and we do the same for periodic points. We also describe the…

A crossing-free morph is a continuous deformation between two graph drawings that preserves straight-line pairwise noncrossing edges. Motivated by applications in 3D morphing problems, we initiate the study of morphing graph drawings in the…

The topic of this paper is related to the well-known notion of unit distance graphs. Take a graph with its edges coloured red and blue such that for some $d$ it can be mapped into the plane with all vertices going to distinct points, the…

Let $\mathcal{G}_n^k=\{G_1,G_2,\ldots,G_k\}$ be a multiset of graphs on vertex set $[n]$ and let $F$ be a fixed graph with edge set $F=\{e_1, e_2,\ldots, e_m\}$ and $k\ge m$. We say ${\mathcal{G}_n^k}$ is rainbow $F$-free if there is no…

Let $M$ be a nilmanifold with a fundamental group which is free $2$-step nilpotent on at least 4 generators. We will show that for any nonnegative integer $n$ there exists a self-diffeomorphism $h_n$ of $M$ such that $h_n$ has exactly $n$…

In this paper, we present the Brouwer-Schauder-Tychonoff fixed point theorem on locally convex spaces as the following extension and improvement: Suppose that S is a compact star-shaped subset with respect to p in S with its convexity index…

We present fixed parameter tractable algorithms for the conflict-free coloring problem on graphs. Given a graph $G=(V,E)$, \emph{conflict-free coloring} of $G$ refers to coloring a subset of $V$ such that for every vertex $v$, there is a…

A graph is $H$-free if it has no induced subgraph isomorphic to $H$. We characterize all graphs $H$ for which there are only finitely many minimal non-three-colorable $H$-free graphs. Such a characterization was previously known only in the…

We established a fixed-point theorem for mapping satisfying a general contractive inequality of integral type depended an another function. This theorem substantially extend the theorem due to Branciari (2003) and Rhoades (2003)

In this paper we prove some new fixed point theorems for multivalued mappings on orbitally complete uniform spaces.

For a fixed integer, the $k$-Colouring problem is to decide if the vertices of a graph can be coloured with at most $k$ colours for an integer $k$, such that no two adjacent vertices are coloured alike. A graph $G$ is $H$-free if $G$ does…

A balanced colouring of a graph is one in which every colour appears the same number of times. Given a fixed graph $H$ on $r$ vertices and a balanced $k$-colouring of the complete graph $K_{nrk}$, Hollom (2025) asked the following question:…

The number of diagrams of stationary points free vector fields in the 2-disk $\mathbb{B}^{2}$ is counted in the article. It is shown that the number of such diagrams with $2k$ exceptional points on the boundary $\mathbb{S}^{1}$ equals…

Let $k$ be an positive integer. For any two integers $i$ and $j$ in $\{0,1,\dots,k-1\}$, let $|i-j|_k=\min\{|i-j|,k-|i-j|\}$ be the circular distance between $i$ and $j$. Let $t$ be a nonnegative integer. Suppose $f$ is a mapping from…

For positive integers $a$ and $b$, a graph $G$ is $(a:b)$-choosable if, for each assignment of lists of $a$ colors to the vertices of $G,$ each vertex can be colored with a set of $b$ colors from its list so that adjacent vertices are…

Given an essentially finite type morphism of schemes f: X --> Y and a positive integer d, let f^{d}: X^{d} --> Y denote the natural map from the d-fold fiber product, X^{d}, of X over Y and \pi_i: X^{d} --> X the i'th canonical projection.…

We study the infinite graph of $n$-dimensional rectangular grid that doesn't appear distance regular and the distance regular colorings of this graph, which are defined as the distance colorings with respect to completely regular codes. It…

Balogh and Bollob\'as [{\em Combinatorica 25, 2005}] prove that for any $k$ there is a constant $f(k)$ such that any set system with at least $f(k)$ sets reduces to a $k$-star, an $k$-costar or an $k$-chain. They proved $f(k)<(2k)^{2^k}$.…

The classical Andr\'{a}sfai-Erd\H{o}s-S\'{o}s theorem considers the chromatic number of $K_{r + 1}$-free graphs with large minimum degree, and in the case $r = 2$ says that any $n$-vertex triangle-free graph with minimum degree greater than…

We study two questions posed by Johnson, Lindenstrauss, Preiss, and Schechtman, concerning the structure of level sets of uniform and Lipschitz quotient maps from $R^n\to R$. We show that if $f:R^n\to R$, $n\geq 2$, is a uniform quotient…