Recovering Set Systems and Graph Entropy
Attila Sali, Gábor Simonyi · Combinatorics Probability Computing · 1997
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.