Recovering Set Systems and Graph Entropy

DOI10.1017/S0963548397003271MaRDI QIDQ4372996zbMATH OpenOpenAlexFDO

Authors Attila Sali, Gábor Simonyi

Publication date 8 March 1998

Published in Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/s0963548397003271

zbMATH Keywords

conjecture of Ahlswede and Simonyiextremal set familiesgraph entropygraph invariant

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Extremal set theory (05D05)

Recommendations

• Entropy and the complexity of graphs revisited
• scientific article; zbMATH DE number 167195
• scientific article; zbMATH DE number 780788
• On graph entropy measures based on the number of independent sets and matchings
• scientific article; zbMATH DE number 1092008
• The set of sequence entropies for graph maps
• Mathematical foundations and applications of graph entropy
• Szeged-like entropies of graphs
• On Complementary Graph Entropy
• On the von Neumann entropy of graphs

Cited in

(4)

• On the optimal structure of recovering set pairs in lattices: The sandglass conjecture
• New bounds on Simonyi's conjecture
• Some results on the sandglass conjecture
• Strongly cancellative and recovering sets on lattices

This page was built for publication: Recovering Set Systems and Graph Entropy

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4372996)