A SHARP ESTIMATE ON THE DEGREE OF APPROXIMATION TO FUNCTIONS OF BOUNDED VARIATION BY CERTAIN OPERATORS

Recently Guo introduced integrated Meyer -Konig and Zeller operators and studied the rate of convergence for function of bounded variation. In this note we give a sharp estimate for these operators.

Acyclic colorings of graphs with bounded degree

A k coloring(not necessarily proper) of vertices of a graph is called acyclic, if for every pair of distinct colors i and j the subgraph induced by the edges whose endpoints have colors i and j is acyclic. We consider some generalized acyclic k colorings, namely, we require that each color class induces an acyclic or bounded degree graph. Mainly we focus on graphs with maximum degree 5. We prove that any such graph has an acyclic 5 coloring such that each color class induces an acyclic graph with maximum degree at most 4. We prove that the problem of deciding whether a graph G has an acyclic 2 coloring in which each color class induces a graph with maximum degree at most 3 is NP complete, even for graphs with maximum degree 5. We also give a linear time algorithm for an acyclic t improper coloring of any graph with maximum degree d assuming that the number of colors is large enough.

Acyclic improper colouring of graphs with maximum degree 4

A k-colouring （not necessarily proper） of vertices of a graph is called acyclic, if for every pair of distinct colours i and j the subgraph induced by the edges whose endpoints have colours i and j is acyclic. We consider acyclie k-eolourings such that each colour class induces a graph with a given （hereditary） property. In particular, we consider aeyclic k-eolourings in which each colour class induces a graph with maximum degree at most t, which are referred to as acyclic t-improper k-colourings. The acyelic t-improper chromatic number of a graph G is the smallest k for which there exists an acyclic t-improper k-colouring of G. We focus on acyclic colourings of graphs with maximum degree 4. We prove that 3 is an upper bound for the acyclic 3-improper chromatic number of this class of graphs. We also provide a non-trivial family of graphs with maximum degree 4 whose acyclic 3-improper chromatic number is at most 2, namely, the graphs with maximum average degree at most 3. Finally, we prove that any graph G with A（G） ≤ 4 can be acyelically coloured with 4 colours in such a way that each colour class induces an acyclic graph with maximum degree at most 3.

Rational Solutions of First Order Algebraic Ordinary Differential Equations

Let f(t,y,y')=∑ _(i=0)^(n )a_(i)(t,y)y'^(i)=0 be an irreducible first order ordinary differential equation with polynomial coefficients.Eremenko in 1998 proved that there exists a constant C such that every rational solution of f(t,y,y')=0 is of degree not greater than C.Examples show that this degree bound C depends not only on the degrees of f in t,y,y' but also on the coefficients of f viewed as the polynomial in t,y,y'.In this paper,the authors show that if f satisfies deg(f,y)<deg(f,y')or n max i=0{deg(a_(i),y)−2(n−i)}>0,then the degree bound C only depends on the degrees of f in t,y,y',and furthermore we present an explicit expression for C in terms of the degrees of f in t,y,y'.