No CrossRef data available.
Article contents
Recovering Set Systems and Graph Entropy
Published online by Cambridge University Press: 01 December 1997
Abstract
Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.
A relationship between a new and an old graph invariant is established. The first invariant is connected to the ‘sandglass conjecture’ of [1]. The second one is graph entropy, an information theoretic functional, which is already known to be relevant in several combinatorial contexts.
Information
- Type
- Research Article
- Information
- Copyright
- 1997 Cambridge University Press
You have
Access
- 4
- Cited by