✦ LIBER ✦

A Generalization of a Theorem of Beardon on Analytic Contraction Mappings

✍ Scribed by P.J. Rippon

Publisher: Elsevier Science
Year: 1996
Tongue: English
Weight: 116 KB
Volume: 199
Category: Article
ISSN: 0022-247X
DOI: 10.1006/jmaa.1996.0133

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On a generalization of Rubin's theorem

✍ Dmitry A. Shabanov 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 89 KB

The work is devoted to the calculation of asymptotic value of the choice number of the complete r-partite graph K m \* r = K m,. ..,m with equal part size m. We obtained the asymptotics in the case ln r = o(ln m). The proof generalizes the classical result of A.L. Rubin for the case r = 2.

Compact analytic mappings of B-spaces an

Compact analytic mappings of B-spaces and a theorem of Jane Cronin

✍ J. Schwartz 📂 Article 📅 1963 🏛 John Wiley and Sons 🌐 English ⚖ 438 KB 👁 1 views

A generalization of Plantholt's theorem

✍ A. J. W. Hilton 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 152 KB

A generalization of Turán's theorem

✍ Benny Sudakov; Tibor Szabó; H. Van Vu 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 94 KB

## Abstract In this paper, we obtain an asymptotic generalization of Turán's theorem. We prove that if all the non‐trivial eigenvalues of a __d__‐regular graph __G__ on __n__ vertices are sufficiently small, then the largest __K__~__t__~‐free subgraph of __G__ contains approximately (__t__ − 2)/(__

A Generalization of a Theorem of Dirac

✍ Tristan Denley; Haidong Wu 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 85 KB

In this paper, we give a generalization of a well-known result of Dirac that given any k vertices in a k-connected graph where k 2, there is a circuit containing all of them. We also generalize a result of Ha ggkvist and Thomassen. Our main result partially answers an open matroid question of Oxley.

A generalization of a Ramsey-type theore

A generalization of a Ramsey-type theorem on hypermatchings

✍ Paul Baginski 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 93 KB

## Abstract For an __r__‐uniform hypergraph __G__ define __N__(__G__, __l__; 2) (__N__(__G__, __l__; ℤ~__n__~)) as the smallest integer for which there exists an __r__‐uniform hypergraph __H__ on __N__(__G__, __l__; 2) (__N__(__G__,__l__; ℤ~__n__~)) vertices with clique(__H__) < __l__ such that eve