Some results on the complexity of famili
โ
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