✦ LIBER ✦

Disjoint sets of distinct sum sets

✍ Scribed by Wende Chen; Torleiv Kløve

Book ID: 111714001
Publisher: Elsevier Science
Year: 1997
Tongue: English
Weight: 312 KB
Volume: 175
Category: Article
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(96)00142-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Bounds and constructions of disjoint set

Bounds and constructions of disjoint sets of distinct difference sets

✍ Klove, T. 📂 Article 📅 1990 🏛 IEEE 🌐 English ⚖ 626 KB

New Constructions of Disjoint Distinct D

New Constructions of Disjoint Distinct Difference Sets

✍ Wende Chen; Zhi Chen; Torleiv Klove 📂 Article 📅 1998 🏛 Springer 🌐 English ⚖ 67 KB

Siegel’s Lemma and Sum-Distinct Sets

✍ Iskander Aliev 📂 Article 📅 2008 🏛 Springer 🌐 English ⚖ 273 KB

Transversals of Disjoint Sets

✍ Milner, E. C. 📂 Article 📅 1968 🏛 Oxford University Press 🌐 English ⚖ 156 KB

On Families of Sets of Integral Vectors

On Families of Sets of Integral Vectors Whose Representatives form Sum-Distinct Sets

✍ Jevtić, Dušan B. 📂 Article 📅 1995 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 868 KB

On Crossing Sets, Disjoint Sets, and Pag

On Crossing Sets, Disjoint Sets, and Pagenumber

✍ Farhad Shahrokhi; Weiping Shi 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 109 KB

Let G s V, E be a t-partite graph with n vertices and m edges, where the Ž 2 1.5 . partite sets are given. We present an O n m time algorithm to construct drawings of G in the plane so that the size of the largest set of pairwise crossing Ž edges and, at the same time, the size of the largest set of