On the equivalence of different classes of hereditary systems
β Scribed by Cristina Marcelli; Anna Salvadori
- Publisher
- Elsevier Science
- Year
- 1997
- Tongue
- English
- Weight
- 284 KB
- Volume
- 30
- Category
- Article
- ISSN
- 0362-546X
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
We prove that different formulations of hereditary settings for ordinary differential systems, which appeared not comparable, are actually equivalent.
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
A hereditary property of graphs is a class of graphs which is closed under taking induced subgraphs. For a hereditary property \(\mathscr{P}\), let \(\mathscr{P}_{n}\) denote the set of \(\mathscr{P}\) graphs on \(n\) labelled vertices. Clearly we have \(0 \leqslant\left|\mathscr{P}_{n}\right| \leqs