Ramsey numbers of odd cycles versus larger even wheels

The generalized Ramsey number $R(G_1,G_2)$ is the smallest positive integer $N$ such that any red–blue coloring of the edges of the complete graph $K_N$ either contains a red copy of $G_1$ or a blue copy of $G_2$. Let $C_m$ denote a cycle of length $m$ and $W_n$ denote a wheel with $n+1$ vertices. In 2014, Zhang, Zhang and Chen determined many of the Ramsey numbers $R(C_{2k+1},W_n)$ of odd cycles versus larger wheels, leaving open the particular case where $n=2j$ is even and $k<j<3k∕2$. They conjectured that for these values of $j$ and $k$, $R(C_{2k+1},W_{2j})=4j+1$. In 2015, Sanhueza-Matamala confirmed this conjecture asymptotically, showing that $R(C_{2k+1},W_{2j})\le 4j+334$. In this paper, we prove the conjecture of Zhang, Zhang and Chen for almost all of the remaining cases. In particular, we prove that $R(C_{2k+1},W_{2j})=4j+1$ if $j?k\ge 251$, $k<j<3k∕2$, and $j\ge 212299$.     

Self-similar solutions of stationary Navier–Stokes equations

In this paper, we mainly study the existence of self-similar solutions of stationary Navier–Stokes equations for dimension $n=3,4$. For $n=3$, if the external force is axisymmetric, scaling invariant, $C^{1,\alpha }$ continuous away from the origin and small enough on the sphere $S^2$, we shall prove that there exists a family of axisymmetric self-similar solutions which can be arbitrarily large in the class $C_{loc}^{3,\alpha }({\mathbb{R}}^3\backslash 0)$. Moreover, for axisymmetric external forces without swirl, corresponding to this family, the momentum flux of the flow along the symmetry axis can take any real number. However, there are no regular ($U\in C_{loc}^{3,\alpha }({\mathbb{R}}^3\backslash 0)$) axisymmetric self-similar solutions provided that the external force is a large multiple of some scaling invariant axisymmetric F which cannot be driven by a potential. In the case of dimension 4, there always exists at least one self-similar solution to the stationary Navier–Stokes equations with any scaling invariant external force in $L^{4/3,\infty }({\mathbb{R}}^4)$.     

Proper connection and size of graphs

An edge-coloured graph $G$ is called properly connected if any two vertices are connected by a path whose edges are properly coloured. The proper connection number of a connected graph $G,$ denoted by $\mathrm{pc}\left(G\right)$, is the smallest number of colours that are needed in order to make $G$ properly connected. Our main result is the following: Let $G$ be a connected graph of order $n$ and $k\ge 2$. If $\left|E\left(G\right)\right|\ge \left(\genfrac{}{}{0ex}{}{n?k?1}{2}\right)+k+2$, then $\mathrm{pc}\left(G\right)\le k$ except when $k=2$ and $G\in \{G_1,G_2\},$ where $G_1=K_1\vee (2K_1+K_2)$ and $G_2=K_1\vee (K_1+2K_2).$     

The NLC-width and clique-width for powers of graphs of bounded tree-width

The $k$-power graph of a graph $G$ is a graph with the same vertex set as $G$, in that two vertices are adjacent if and only if, there is a path between them in $G$ of length at most $k$. A $k$-tree-power graph is the $k$-power graph of a tree, a $k$-leaf-power graph is the subgraph of some $k$-tree-power graph induced by the leaves of the tree.We show that (1) every $k$-tree-power graph has NLC-width at most $k+2$ and clique-width at most $k+2+max\{?\frac{k}{2}??1,0\}$, (2) every $k$-leaf-power graph has NLC-width at most $k$ and clique-width at most $k+max\{?\frac{k}{2}??2,0\}$, and (3) every $k$-power graph of a graph of tree-width $l$ has NLC-width at most ${(k+1)}^{l+1}?1$, and clique-width at most $2?{(k+1)}^{l+1}?2$.     

Hölder estimates for fractional parabolic equations with critical divergence free drifts

This work focuses on drift-diffusion equations with fractional dissipation ${(?\mathrm{\Delta })}^{\alpha }$ in the regime $\alpha \in (1/2,1)$. Our main result is an a priori Hölder estimate on smooth solutions to the Cauchy problem, starting from initial data with finite energy. We prove that for some $\beta \in (0,1)$, the $C^{\beta }$ norm of the solution depends only on the size of the drift in critical spaces of the form $L_t^q({\mathrm{BMO}}_x^{?\gamma })$ with $q>2$ and $\gamma \in (0,2\alpha ?1]$, along with the $L_x^2$ norm of the initial datum. The proof uses the Caffarelli/Vasseur variant of De Giorgi's method for non-local equations.     

d-matching in 3-uniform hypergraphs

A matching in a 3-uniform hypergraph is a set of pairwise disjoint edges. A $d$-matching in a 3-uniform hypergraph $H$ is a matching of size $d$. Let $V_1,V_2$ be a partition of $n$ vertices such that $\left|V_1\right|=2d?1$ and $\left|V_2\right|=n?2d+1$. Denote by $E_3(2d?1,n?2d+1)$ the 3-uniform hypergraph with vertex set $V_1\cup V_2$ consisting of all those edges which contain at least two vertices of $V_1$. Let $H$ be a 3-uniform hypergraph of order $n\ge 9d^2$ such that $deg\left(u\right)+deg\left(v\right)>2\left[\left(\genfrac{}{}{0ex}{}{n?1}{2}\right)?\left(\genfrac{}{}{0ex}{}{n?d}{2}\right)\right]$ for any two adjacent vertices $u,v\in V\left(H\right)$. In this paper, we prove $H$ contains a $d$-matching if and only if $H$ is not a subgraph of $E_3(2d?1,n?2d+1)$.     

An extension of an inequality for ratios of gamma functions

In this paper, we prove that for $x+y>0$ and $y+1>0$ the inequality $\frac{{[\Gamma (x+y+1)/\Gamma (y+1)]}^{1/x}}{{[\Gamma (x+y+2)/\Gamma (y+1)]}^{1/(x+1)}}<{\left(\frac{x+y}{x+y+1}\right)}^{1/2}$ is valid if $x>1$ and reversed if $x<1$ and that the power $\frac{1}{2}$ is the best possible, where $\Gamma \left(x\right)$ is the Euler gamma function. This extends the result of [Y. Yu, An inequality for ratios of gamma functions, J. Math. Anal. Appl. 352 (2) (2009) 967–970] and resolves an open problem posed in [B.-N. Guo, F. Qi, Inequalities and monotonicity for the ratio of gamma functions, Taiwanese J. Math. 7 (2) (2003) 239–247].