✦ LIBER ✦

Extremal Problems for Quasiconformal Mappings

✍ Scribed by Shen Yu-Liang

Publisher: Elsevier Science
Year: 2000
Tongue: English
Weight: 198 KB
Volume: 247
Category: Article
ISSN: 0022-247X
DOI: 10.1006/jmaa.2000.6806

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the Distortion Theorem for Quasiconfo

On the Distortion Theorem for Quasiconformal Mappings with Fixed Boundary Values

✍ Huang Xinzhong; Nak Eun Cho 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 51 KB

For a planar domain ⍀ with at least three boundary points and the ⍀ hyperbolic metric of ⍀ with constant curvature y1, G. J. Martin poses a problem that asks, if f is a K-quasiconformal self-homeomorphism of ⍀ with boundary Ž Ž .. values given by the identity mapping, whether z, f z F log K holds fo

Extremal results for rooted minor proble

Extremal results for rooted minor problems

✍ Leif K Jørgensen; Ken-ichi Kawarabayashi 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 202 KB

## Abstract In this article, we consider the following problem. Given four distinct vertices __v__~1~,__v__~2~,__v__~3~,__v__~4~. How many edges guarantee the existence of seven connected disjoint subgraphs __X__~i~ for __i__ = 1,…, 7 such that __X__~j~ contains __v__~j~ for __j__ = 1, 2, 3, 4 and

Extremal problems for chromatic neighbor

Extremal problems for chromatic neighborhood sets

✍ André Kündgen; Michael Molloy 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 79 KB

## Abstract The chromatic neighborhood sequence of a graph G is the list of the chromatic numbers of the subgraphs induced by the neighborhoods of the vertices. We study the maximum multiplicity of this sequence, proving, amongst other things, that if a chromatic neighborhood sequence has __t__ dis

Minimizer graphs for a class of extremal

Minimizer graphs for a class of extremal problems

✍ Dan Ismailescu; Dan Stefanica 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 93 KB 👁 2 views

## Abstract We consider the family of graphs with a fixed number of vertices and edges. Among all these graphs, we are looking for those minimizing the sum of the square roots of the vertex degrees. We prove that there is a unique such graph, which consists of the largest possible complete subgraph

Some Extremal Problems for Multivariate

Some Extremal Problems for Multivariate Polynomialson Convex Bodies

✍ András Kroó; Darrell Schmidt 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 394 KB

In this paper we extend some Chebyshev and Remez-type inequalities for multivariate polynomials. ## 1997 Academic Press Consider the set P n of complex valued polynomials of m real variables and of total degree at most n: | the uniform norm of p on K, and let ' m (K) be the m-dimensional Lebesque

Weak Eigenfunctions for the Linearizatio

Weak Eigenfunctions for the Linearization of Extremal Elliptic Problems

✍ Xavier Cabré; Yvan Martel 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 466 KB

We consider the semilinear elliptic problem where \* is a nonnegative parameter and g is a positive, nondecreasing, convex nonlinearity. There exists a value \*\* of the parameter which is extremal in terms of existence of solution. We study the linearization of the semilinear problem at the extrem