✦ LIBER ✦

A theorem about antiprisms

✍ Scribed by Mark N. Broadie

Publisher: Elsevier Science
Year: 1985
Tongue: English
Weight: 661 KB
Volume: 66
Category: Article
ISSN: 0024-3795
DOI: 10.1016/0024-3795(85)90127-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A covering theorem about radial segments

✍ Tetsuo Inoue 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 216 KB

On a theorem about vertex colorings of g

On a theorem about vertex colorings of graphs

✍ Claudio Bernardi 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 121 KB

Lawrence [2, Theorem 3] and Borodin and Kostochka [1, Lemma 2' 1 both give the same theorem about vertex colorings of graphs (Corollary 1 below). But Lawrence's proof, although powerful, is a little long, and Borodin and Kostoehka state the result without a proof.

On a theorem of Rimhak Ree about permuta

On a theorem of Rimhak Ree about permutations

✍ Carol Tretkoff; Marvin Tretkoff 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 182 KB

Helly-type theorems about sets

✍ Steve Fisk; Daniel Abbw-Jackson; Dan Kleitman 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 724 KB

Suppose that G ifn a graph. A l-factor is a set of edges of G such that every vertex of G meets exactly one of its edges. Suppose that we have a set Y of l-factors of G such that any two l-factors vf Y have an edge in common. We investigate the following questions: (1) How large may Y be? (2) When

Some theorems about bounded structures

✍ Lucien Waelbroeck 📂 Article 📅 1967 🏛 Elsevier Science 🌐 English ⚖ 980 KB

Two Theorems about Equationally Noetheri

Two Theorems about Equationally Noetherian Groups

✍ Gilbert Baumslag; Alexei Myasnikov; Vitaly Roman'kov 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 176 KB

An algebraic set over a group G is the set of all solutions of some system Ä Ž . ² :4 f x , . . . , x s 1 N f g G) x , . . . , x of equations over G. A group G is equa- tionally noetherian if every algebraic set over G is the set of all solutions of a finite subsystem of the given one. We prove tha