✦ LIBER ✦

A quick proof of Riemann's mapping theorem

✍ Scribed by H. P. McKean

Publisher: John Wiley and Sons
Year: 1999
Tongue: English
Weight: 278 KB
Volume: 52
Category: Article
ISSN: 0010-3640
DOI: 10.1002/(sici)1097-0312(199903)52:3<405::aid-cpa4>3.0.co;2-o

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A simple proof of Moser's theorem

✍ Zhu, Xuding 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 243 KB 👁 2 views

This article gives a simple proof of a result of Moser, which says that, for any rational number r between 2 and 3, there exists a planar graph G whose circular chromatic number is equal to r.

A short proof of K�nig's matching theore

A short proof of K�nig's matching theorem

✍ Rizzi, Romeo 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 43 KB 👁 2 views

We give a short proof of the following basic fact in matching theory: in a bipartite graph the maximum size of a matching equals the minimum size of a node cover.

A short proof of a theorem on Hamiltonia

A short proof of a theorem on Hamiltonian graphs

✍ Ainouche, A. 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 219 KB 👁 2 views

In this note, w e give a short proof of a stronger version of the following theorem: Let G be a 2-connected graph of order n such that for any independent set {u, u , w}, then G is hamiltonian. 0 1996 John

A Constructive Version of the Spectral M

A Constructive Version of the Spectral Mapping Theorem

✍ Douglas Bridges; Robin Havea 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 125 KB

A new proof of the Caffarelli-Kohn-Niren

A new proof of the Caffarelli-Kohn-Nirenberg theorem

✍ Fanghua Lin 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 220 KB 👁 2 views

Here we give a self-contained new proof of the partial regularity theorems for solutions of incompressible Navier-Stokes equations in three spatial dimensions. These results were originally due to Scheffer and Caffarelli, Kohn, and Nirenberg. Our proof is much more direct and simpler.

A continuous analogue of Sperner's theor

A continuous analogue of Sperner's theorem

✍ Daniel A. Klain; Gian-Carlo Rota 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 149 KB 👁 1 views

One of the best-known results of extremal combinatorics is Sperner's theorem, which asserts that the maximum size of an antichain of subsets of an n-element set equals the binomial coefficient n n/2 , that is, the maximum of the binomial coefficients. In the last twenty years, Sperner's theorem has