✦ LIBER ✦

An Extension of E. Bishop's Localization Theorem

✍ Scribed by A.A Danielyan; E.B Saff

Publisher: Elsevier Science
Year: 2001
Tongue: English
Weight: 106 KB
Volume: 109
Category: Article
ISSN: 0021-9045
DOI: 10.1006/jath.2000.3539

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An extension of Vizing's theorem

✍ Chew, K. H. 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 110 KB

Let G = (V (G), E(G)) be a simple graph of maximum degree ∆ ≤ D such that the graph induced by vertices of degree D is either a null graph or is empty. We give an upper bound on the number of colours needed to colour a subset S of V (G) ∪ E(G) such that no adjacent or incident elements of S receive

Edge list multicoloring trees: An extens

Edge list multicoloring trees: An extension of Hall's theorem

✍ Mathew Cropper; András Gyárfás; Jenő Lehel 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 99 KB

## Abstract We prove a necessary and sufficient condition for the existence of edge list multicoloring of trees. The result extends the Halmos–Vaughan generalization of Hall's theorem on the existence of distinct representatives of sets. © 2003 Wiley Periodicals, Inc. J Graph Theory 42: 246–255, 20

An Extension of a Theorem on Gambling Sy

An Extension of a Theorem on Gambling Systems

✍ W. Liu; Z.Z. Wang 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 212 KB

An Extension of the Corollary to Steinme

An Extension of the Corollary to Steinmetzs Theorem

✍ F. Gross; C.F. Osgood 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 199 KB

Extension of Toyoda's theorem on entropi

Extension of Toyoda's theorem on entropic groupoids

✍ Vladimir Volenec 📂 Article 📅 1981 🏛 John Wiley and Sons 🌐 English ⚖ 281 KB

## Extension of Toyoda's theorem on entropic groupoids By VLADIMRC VOLENEC of Zagreb (Eingegangen am 8. 10. 1980) A groupoid (a, .) is said to be entropic iff for every a, b, c, d E G the equality (1) ab cd = acbd holds true. A well-known TOYODA'S theorem ([S], [a], [21 and [l], 1). 33) asserts th

Posets That Locally Resemble Distributiv

Posets That Locally Resemble Distributive Lattices: An Extension of Stanley's Theorem (with Connections to Buildings and Diagram Geometries)

✍ Jonathan David Farley; Stefan E. Schmidt 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 335 KB

Let P be a graded poset with 0 and 1 and rank at least 3. Assume that every rank 3 interval is a distributive lattice and that, for every interval of rank at least 4, the interval minus its endpoints is connected. It is shown that P is a distributive lattice, thus resolving an issue raised by Stanle