On the structure of blackwell's equivalence classes of information systems
β Scribed by E. Sulganik
- Publisher
- Elsevier Science
- Year
- 1996
- Tongue
- English
- Weight
- 41 KB
- Volume
- 31
- Category
- Article
- ISSN
- 0165-4896
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
A class of graphs is hereditary if it is closed under taking induced subgraphs. Classes associated with graph representations have "composition sequences" and we show that this concept is equivalent to a notion of "amalgamation" which generalizes disjoint union of graphs. We also discuss how general
Let P\* denote the graph obtained by joining a new vertex to every vertex of a path on n vertices. Let Ui,j(n) denote the set of all connected graphs obtained from PfwP\* by connecting the four vertices of degree 2 by two paths of lengths s( 1> 0) and t( ~> 1) such that s + t = n -i -j is a constant