A vertex $k$-coloring of a graph $G$ is a if $M\left(u\right)\ne M\left(v\right)$ for every edge $uv\in E\left(G\right)$, where $M\left(u\right)$ and $M\left(v\right)$ denote the multisets of colors of the neighbors of $u$ and $v$, respectively. The minimum $k$ for which $G$ has a multiset $k$-coloring is the ${\chi }_m\left(G\right)$ of $G$. For an integer $\ell \ge 0$, the $\ell$- of a graph $G$, ${\mathrm{cor}}^{\ell }\left(G\right)$, is the graph obtained from $G$ by adding, for each vertex $v$ in $G$, $\ell$ new neighbors which are end-vertices. In this paper, the multiset chromatic numbers are determined for $\ell$- of all complete graphs, the regular complete...

We prove that, assuming , if $X$ is a space with ${\aleph }_1$-calibre and a zeroset diagonal, then $X$ is submetrizable. This gives a consistent positive answer to the question of Buzyakova in Observations on spaces with zeroset or regular $G_{\delta }$-diagonals, Comment. Math. Univ. Carolin. 46 (2005), no. 3, 469–473. We also make some observations on spaces with ${\aleph }_1$-calibre.

Let $\varphi$ be a substitution of Pisot type on the alphabet $𝒜=\{1,2,...,d\}$; $\varphi$ satisfies theif for every $i,j\in 𝒜$, there are integers $k,n$ such that ${\varphi }^n\left(i\right)$ and ${\varphi }^n\left(j\right)$ have the same $k$-th letter, and the prefixes of length $k-1$ of ${\varphi }^n\left(i\right)$ and ${\varphi }^n\left(j\right)$ have the same image under the abelianization map. We prove that the strong coincidence condition is satisfied if $d=2$ and provide a partial result for $d\ge 2$.

The Ramsey number $R(G,H)$ for a pair of graphs $G$ and $H$ is defined as the smallest integer $n$ such that, for any graph $F$ on $n$ vertices, either $F$ contains $G$ or $\overline{F}$ contains $H$ as a subgraph, where $\overline{F}$ denotes the complement of $F$. We study Ramsey numbers for some subgraphs of generalized wheels versus cycles and paths and determine these numbers for some cases. We extend many known results studied in [5, 14, 18, 19, 20]. In particular we count the numbers $R(K_1+L_n,P_m)$ and $R(K_1+L_n,C_m)$ for some integers $m$, $n$, where $L_n$ is...

A proper vertex coloring of a graph $G$ is acyclic if there is no bicolored cycle in $G$. In other words, each cycle of $G$ must be colored with at least three colors. Given a list assignment $L=\left\{L\right(v):v\in V\}$, if there exists an acyclic coloring $\pi$ of $G$ such that $\pi \left(v\right)\in L\left(v\right)$ for all $v\in V$, then we say that $G$ is acyclically $L$-colorable. If $G$ is acyclically $L$-colorable for any list assignment $L$ with $\left|L\right(v\left)\right|\ge k$ for all $v\in V$, then $G$ is acyclically $k$-choosable. In 2006, Montassier, Raspaud and Wang conjectured that every planar graph without...

A real form $G$ of a complex semi-simple Lie group $G^{ℂ}$ has only finitely many orbits in any given $G^{ℂ}$-flag manifold $Z=G^{ℂ}/Q$. The complex geometry of these orbits is of interest, e.g., for the associated representation theory. The open orbits $D$ generally possess only the constant holomorphic functions, and the relevant associated geometric objects are certain positive-dimensional compact complex submanifolds of $D$ which, with very few well-understood exceptions, are parameterized by the Wolf cycle...

We consider limit cycles of a class of polynomial differential systems of the form $$\left\{\begin{array}{c}\dot{x}=y,\hfill \\ \dot{y}=-x-\epsilon (g_{21}\left(x\right)y^{2\alpha +1}+f_{21}\left(x\right)y^{2\beta })-{\epsilon }^2(g_{22}\left(x\right)y^{2\alpha +1}+f_{22}\left(x\right)y^{2\beta }),\hfill \end{array}\right.$$ where $\beta$ and $\alpha$ are positive integers, $g_{2j}$ and $f_{2j}$ have degree $m$ and $n$, respectively, for each $j=1,2$, and $\epsilon$ is a small parameter. We obtain the maximum number of limit cycles that bifurcate from the periodic orbits of the linear center $\dot{x}=y$, $\dot{y}=-x$ using the averaging theory of first and second order.

Let $p$ be a prime integer and $F$ a field of characteristic $0$. Let $X$ be theof a symbol in the Galois cohomology group $H^{n+1}(F,{\mu }_p^{\otimes n})$ (for some $n\ge 1$), constructed in the proof of the Bloch-Kato conjecture. The main result of the paper affirms that the function field $F\left(X\right)$ has the following property: for any equidimensional variety $Y$, the change of field homomorphism $\mathrm{CH}\left(Y\right)\to \mathrm{CH}\left(Y_{F\left(X\right)}\right)$ of Chow groups with coefficients in integers localized at $p$ is surjective in codimensions $\<(dimX)/(p-1)$. One of the main ingredients of the proof is a computation...

Let $𝒜$ be a commutative algebraic group defined over a number field $k$. We consider the following question:A complete answer for the case of the multiplicative group ${𝔾}_m$ is classical. We study other instances and in particular obtain an affirmative answer when $r$ is a prime and $𝒜$ is either an elliptic curve or a torus of small dimension with respect to $r$. Without restriction on the dimension of a torus, we produce an example showing that the answer can be negative even when $r$ is a prime. ...

We study the chemotaxis system with singular sensitivity and logistic-type source: $u_t=\Delta u-\chi \nabla ·(u\nabla v/v)+ru-\mu u^k$, $0=\Delta v-v+u$ under the non-flux boundary conditions in a smooth bounded domain $\Omega \subset {ℝ}^n$, $\chi ,r,\mu >0$, $k>1$ and $n\ge 1$. It is shown with $k\in (1,2)$ that the system possesses a global generalized solution for $n\ge 2$ which is bounded when $\chi >0$ is suitably small related to $r>0$ and the initial datum is properly small, and a global bounded classical solution for $n=1$.

In this paper we study the parabolic Anderson equation $\partial u(x,t)/\partial t=\kappa 𝛥u(x,t)+\xi (x,t)u(x,t)$, $x\in {\mathbb{Z}}^d$, $t\ge 0$, where the $u$-field and the $\xi$-field are $ℝ$-valued, $\kappa \in [0,\infty )$ is the diffusion constant, and $𝛥$ is the discrete Laplacian. The $\xi$-field plays the role of athat drives the equation. The initial condition $u(x,0)=u_0\left(x\right)$, $x\in {\mathbb{Z}}^d$, is taken to be non-negative and bounded. The solution of the parabolic Anderson equation describes the evolution of a field of particles performing independent simple random walks with binary branching: particles jump at rate $2d\kappa$,...

For graphs $G$, $F_1$, $F_2$, we write $G\to (F_1,F_2)$ if for every red-blue colouring of the edge set of $G$ we have a red copy of $F_1$ or a blue copy of $F_2$ in $G$. The size Ramsey number $\widehat{r}(F_1,F_2)$ is the minimum number of edges of a graph $G$ such that $G\to (F_1,F_2)$. Erdős and Faudree proved that for the cycle $C_n$ of length $n$ and for $t\ge 2$ matchings $t{K}_2$, the size Ramsey number $\widehat{r}(t{K}_2,C_n)<n+(4t+3)\sqrt{n}$. We improve their upper bound for $t=2$ and $t=3$ by showing that $\widehat{r}(2K_2,C_n)\le n+2\sqrt{3n}+9$ for $n\ge 12$ and $\widehat{r}(3K_2,C_n)<n+6\sqrt{n}+9$ for $n\ge 25$.