✦ LIBER ✦

Independence number and the complexity of families of sets

✍ Scribed by D.Q. Naiman; H.P. Wynn

Publisher: Elsevier Science
Year: 1996
Tongue: English
Weight: 870 KB
Volume: 154
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(94)00318-d

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Some results on the complexity of famili

Some results on the complexity of families of sets

✍ Daniel Grieser 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 872 KB

Grieser, D., Some results on the complexity of families of sets, Discrete Mathematics 88 (1991) 179-192. Let 'Y be a property of graphs on a fixed n-element vertex set V. The complexity c(P) is the minimal number of edges whose existence in a previously unknown graph H has to be tested such that it

Complexity of Recognizing Equal Unions i

Complexity of Recognizing Equal Unions in Families of Sets

✍ David P. Jacobs; Robert E. Jamison 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 87 KB

A family of sets has the equal union property if there exist two nonempty disjoint subfamilies having equal unions and has the full equal union property if, in addition, all sets are included. Both recognition problems are NP-complete even when restricted to families for which the cardinality of eve

The number of maximal independent sets i

The number of maximal independent sets in connected graphs

✍ Zoltán Füredi 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 286 KB 👁 2 views

Generalizing a theorem of Moon and Moser. we determine the maximum number of maximal independent sets in a connected graph on n vertices for n sufficiently large, e.g., n > 50. = I .32. . .). Example 1.2. Let b, = i(C,), where C,z denotes the circuit of length n. Then b, = 3, 6, = 2, b, = 5, and b,

The structure and maximum number of maxi

The structure and maximum number of maximum independent sets in trees

✍ Jennifer Zito 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 732 KB

A subset of vertices is a maximum independent set if no two of the vertices are joined by an edge and the subset has maximum cardinality. In this paper we answer a question posed by Herb Wilf. We show that the greatest number of maximum independent sets for a tree of n vertices is 2(n-3\* for odd n

Constraints on the number of maximal ind

Constraints on the number of maximal independent sets in graphs

✍ Jiuqiang Liu 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 387 KB 👁 2 views

## Abstract A maximal independent set of a graph __G__ is an independent set that is not contained properly in any other independent set of __G__. Let __i(G)__ denote the number of maximal independent sets of __G__. Here, we prove two conjectures, suggested by P. Erdös, that the maximum number of m

The number of maximal independent sets i

The number of maximal independent sets in a connected graph

✍ Jerrold R. Griggs; Charles M. Grinstead; David R. Guichard 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 1021 KB

We determine the maximum on n vertices can have, and we a question of Wilf. number of maximal independent sets which a connected graph completely characterize the extremal graphs, thereby answering \* Partially supported by NSF grant number DIMS-8401281. t Partially supported by NSF grant number D S