Hostname: page-component-76fb5796d-skm99 Total loading time: 0 Render date: 2024-04-26T22:05:58.853Z Has data issue: false hasContentIssue false
  • English
  • Français

Recovering Set Systems and Graph Entropy

Published online by Cambridge University Press:  01 December 1997

ATTILA SALI  and
GÁBOR SIMONYI
ATTILA SALI
Affiliation:
Mathematical Institute of HAS, 1364 Budapest, POB 127, Hungary; (e-mail: sali@math-inst.hu and simonyi@math-inst.hu)
GÁBOR SIMONYI
Affiliation:
Mathematical Institute of HAS, 1364 Budapest, POB 127, Hungary; (e-mail: sali@math-inst.hu and simonyi@math-inst.hu)
Get access Rights & Permissions [Opens in a new window]

Abstract

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.

Type
Research Article
Information
Combinatorics, Probability and Computing , Volume 6 , Issue 4 , December 1997 , pp. 481 - 491
Copyright
1997 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)