𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On a Conjecture of Ditzian and Runovskii

✍ Scribed by Dai Feng; Wang Kunyang; Yu Chunwu

Publisher
Elsevier Science
Year
2002
Tongue
English
Weight
186 KB
Volume
118
Category
Article
ISSN
0021-9045

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Averages on Caps of Sd − 1
Averages on Caps of Sd − 1
✍ Z. Ditzian; K. Runovskii 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 139 KB

For the sphere S dy 1 , it is shown that the rate of convergence of the average on a cap of S dy 1 to the function is equivalent to the K-functionals constructed using the Laplace᎐Beltrami operator.

On the Sharpness of a Jackson Estimate b
On the Sharpness of a Jackson Estimate by Ditzian–Totik
✍ L. Imhof 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 412 KB

Using ideas of Gru nwald, Marcinkiewicz, and Ve rtesi concerning the divergence of interpolation processes, a counterexample is constructed which establishes that a Jackson estimate for the best approximation by algebraic polynomials given by Ditzian and Totik is sharp in a pointwise sense everywher

On a conjecture of Thomassen and Toft
On a conjecture of Thomassen and Toft
✍ Kriesell, Matthias 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 183 KB 👁 2 views

This article is motivated by a conjecture of Thomassen and Toft on the number s 2 (G) of separating vertex sets of cardinality 2 and the number v 2 (G) of vertices of degree 2 in a graph G belonging to the class G of all 2-connected graphs without nonseparating induced cycles. Let G denote the numbe

On a conjecture of wang and williams
On a conjecture of wang and williams
✍ N. V. R. Mahadev; Uri N. Peled 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 210 KB

## Abstract Wang and Williams defined a __threshold assignment__ for a graph __G__ as an assignment of a non‐negative weight to each vertex and edge of __G__, and a threshold __t__, such that a set __S__ of vertices is stable if and only if the total weight of the subgraph induced by __S__ does not

On a conjecture of bollobás and bosák
On a conjecture of bollobás and bosák
✍ Štefan Znám 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 364 KB

## Abstract It is shown that, for all sufficiently large __k__, the complete graph __K~n~__ can be decomposed into __k__ factors of diameter 2 if and only if __n__ ≥ 6__k__.