Related papers: On harmonic convolutions involving a vertical stri…
A well-known conjecture of Vizing is that $\gamma(G \square H) \ge \gamma(G)\gamma(H)$ for any pair of graphs $G, H$, where $\gamma$ is the domination number and $G \square H$ is the Cartesian product of $G$ and $H$. Suen and Tarr,…
A constrained colouring or, more specifically, an $(\alpha,\beta)$-colouring of a hypergraph $H$, is an assignment of colours to its vertices such that no edge of $H$ contains less than $\alpha$ or more than $\beta$ vertices with different…
For an analytic function f(z)=z+\sum_{n=2}^\infty a_n z^n satisfying the inequality \sum_{n=2}^\infty n(n-1)|a_n|\leq \beta, sharp bound on $\beta$ is determined so that $f$ is either starlike or convex of order $\alpha$. Several other…
For an n-vertex directed graph $G = (V,E)$, a $\beta$-\emph{shortcut set} $H$ is a set of additional edges $H \subseteq V \times V$ such that $G \cup H$ has the same transitive closure as $G$, and for every pair $u,v \in V$, there is a…
Bieberbach's conjecture was very important in the development of Geometric Function Theory, not only because of the result itself, but also due to the large amount of methods that have been developed in search of its proof, it is in this…
We construct, for every \(0<k<1\), a bounded globally univalent harmonic mapping \[ f=h+\overline g \colon \D\to\C \] such that \[ |g'(z)|\le k|h'(z)|,\qquad z\in\D, \] while the analytic part \(h\) is unbounded. The construction is based…
Let S be an nXn real symmetric matrix with spectral decomposition S=Q^T Lambda Q, where Q is an orthogonal matrix and Lambda is diagonal with simple spectrum {lambda_1,..., lambda_n}. Also let O_S e R_S be the orbits by conjugation of S by,…
A conjecture by Rafla from 1988 asserts that every simple drawing of the complete graph $K_n$ admits a plane Hamiltonian cycle. It turned out that already the existence of much simpler non-crossing substructures in such drawings is hard to…
An edge-weighted graph $G$, possibly with loops, is said to be antiferromagnetic if it has nonnegative weights and at most one positive eigenvalue, counting multiplicities. The number of graph homomorphisms from a graph $H$ to an…
Convolutions or Hadamard products of analytic functions is a well explored area of research and many nice results are available in literature. On the other hand, very little is known in general about the convolutions of univalent harmonic…
Let $\beta>0$. Motivated by jumbled graphs defined by Thomason, the celebrated expander mixing lemma and Haemers's vertex separation inequality, we define that a graph $G$ with $n$ vertices is a weakly $(n,\beta)$-graph if $\frac{|X|…
For two graphs $F$ and $H$, the relative Tur\'{a}n number $\mathrm{ex}(H,F)$ is the maximum number of edges in an $F$-free subgraph of $H$. Foucaud, Krivelevich, and Perarnau \cite{FKP} and Perarnau and Reed \cite{PR} studied these…
We give simple proofs of various versions of the Schwarz lemma for real valued harmonic functions and for holomorphic (more generally harmonic quasi\-re\-gu\-lar, shortly HQR) mappings with the strip codomain. Along the way using the…
Let $G$ be a simple graph with maximum degree $\Delta$. We call $G$ \emph{overfull} if $|E(G)|>\Delta \lfloor |V(G)|/2\rfloor$. The \emph{core} of $G$, denoted $G_{\Delta}$, is the subgraph of $G$ induced by its vertices of degree $\Delta$.…
We establish two-point distortion theorems for sense-preserving planar harmonic mappings $f=h+\overline{g}$ which satisfies the univalence criteria in the unit disc such that, Becker's and Nehari`s harmonic version. In addition, we find the…
The study of curvature properties of homogeneous Finsler spaces with $(\alpha, \beta)$-metrics is one of the central problems in Riemann-Finsler geometry. In the present paper, the existence of invariant vector fields on homogeneous Finsler…
In 2000, Enomoto and Ota conjectured that if a graph $G$ satisfies $\sigma_{2}(G) \geq n + k - 1$, then for any set of $k$ vertices $v_{1}, \dots, v_{k}$ and for any positive integers $n_{1}, \dots, n_{k}$ with $\sum n_{i} = |G|$, there…
We obtain the sharp upper and lower bounds for the growth and distortion of the analytic parts $h$ of orientation-preserving harmonic mappings $f=h+\overline g$ (normalized in the standard way) that map the unit disk onto a convex domain.
We consider the following two algorithmic problems: given a graph $G$ and a subgraph $H\subseteq G$, decide whether $H$ is an isometric or a geodesically convex subgraph of $G$. It is relatively easy to see that the problems can be solved…
The principal goal of this paper is to extend the classical problem of find the values of $\alpha\in \C$ for which the mappings, either $F_\alpha(z)=\int_0^z(f(\zeta)/\zeta)^\alpha d\zeta$ or $f_\alpha(z)=\int_0^z(f'(\zeta))^\alpha d\zeta$…