✦ LIBER ✦

On maximal antichains consisting of sets and their complements

✍ Scribed by Hans-Dietrich O.F Gronau

Publisher: Elsevier Science
Year: 1980
Tongue: English
Weight: 320 KB
Volume: 29
Category: Article
ISSN: 0097-3165
DOI: 10.1016/0097-3165(80)90034-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On maximal antichains containing no set

On maximal antichains containing no set and its complement

✍ G.F. Clements; H.-D.O.F. Gronau 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 1016 KB

Let 16k,dk,+.. d k,, be integers and let S denote the set of all vectors x =(x1, . . . , x,) with integral coordinates sz@@ing 05% "4, i = 1,2, . . . r n; equivalently, .S is the set of ail subset of' a mtitiset eonsistiitg of & elements of type i, i = 1,2,. . . , n. A subset X of 3" is an antichain

On chain and antichain families of a par

On chain and antichain families of a partially ordered set

✍ András Frank 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 547 KB

Generalizations of Grillet's theorem on

Generalizations of Grillet's theorem on maximal stable sets and maximal cliques in graphs

✍ Wenan Zang 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 639 KB

On the edge-integrity of some graphs and

On the edge-integrity of some graphs and their complements

✍ R. Laskar; S. Stuecle; B. Piazza 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 483 KB

In this paper the authors study the edge-integrity of graphs. Edge-integrity is a very useful measure of the vulnerability of a network, in particular a communication network, to disruption through the deletion of edges. A number of problems are examined, including some Nordhaus-Gaddum type results.

Maximal sets of triangle-factors on v =

Maximal sets of triangle-factors on v = 6m vertices

✍ Rolf S. Rees 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 179 KB

We show that the necessary condition m ≤ k ≤ 3m -1 that there exists a maximal set of k triangle-factors on 6m ≥ 18 vertices is also sufficient, except possibly when k = m.

Maximal sets of triangle-factors on v =

Maximal sets of triangle-factors on v = 6m + 3 vertices

✍ Rolf S. Rees 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 473 KB

We show that the necessary condition m + 1 ≤ k ≤ 3m + 1 that there exist a maximal set of k triangle-factors on 6m + 3 ≥ 15 vertices is also sufficient, except possibly when k = m + 1, or when 6m + 3 {45, 57, 69, 81, 93, 237, 261, 309, 333, 381}.