✦ LIBER ✦

The Surgery Obstruction of a Disjoint Union

✍ Scribed by Ranicki, A.

Book ID: 120096807
Publisher: Oxford University Press
Year: 1979
Tongue: English
Weight: 182 KB
Volume: s2-20
Category: Article
ISSN: 0024-6107
DOI: 10.1112/jlms/s2-20.3.559

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The Ramsey numbers for disjoint unions o

The Ramsey numbers for disjoint unions of cycles

✍ Tristan Denley 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 671 KB

As usual, for simple graphs G and H, let the Ramsey number r(G,H) be defined as the least number n such that for any graph K of order n, either G is a subgraph of K or H is a subgraph of/(. We shall establish the values of r(aC~,bCs) and r(aCv, bC7) almost precisely (where nG is the graph consisting

Ramsey numbers for a disjoint union of s

Ramsey numbers for a disjoint union of some graphs

✍ Halina Bielak 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 291 KB

A characterization of the complement of

A characterization of the complement of the union of two disjoint Baer subplanes

✍ Lynn M. Batten; Sharad S. Sane 📂 Article 📅 1985 🏛 Springer 🌐 English ⚖ 469 KB

Generating all subsets of a finite set w

Generating all subsets of a finite set with disjoint unions

✍ David Ellis; Benny Sudakov 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 308 KB

Supermagic coverings of the disjoint uni

Supermagic coverings of the disjoint union of graphs and amalgamations

✍ Maryati, T.K.; Salman, A.N.M.; Baskoro, E.T. 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 798 KB

Every semilinear set is a finite union o

Every semilinear set is a finite union of disjoint linear sets

✍ Ryuichi Ito 📂 Article 📅 1969 🏛 Elsevier Science 🌐 English ⚖ 436 KB

We prove in this paper that every semilinear set is a finite union of disjoint linear sets, using elementary combinatorial-topological lemmas. This paper gives a positive answer to an open problem proposed by Seymour Ginsburg in his book ([2], p. 195). Let N denote the nonnegative integers and R d