A note on counting very different sequences

DOI10.1017/S0963548301004783MaRDI QIDQ2777896zbMATH OpenFDO

Authors Emanuela Fachini, János Körner

Publication date 11 September 2002

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

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

zbMATH Keywords

graph entropyvery different sequences

Mathematics Subject Classification ID

Extremal set theory (05D05) Measures of information, entropy (94A17)

Recommendations

• On the Shannon capacity of probabilistic graphs
• Maximum size of a family of pairwise graph-different permutations
• scientific article; zbMATH DE number 826055
• Forbiddance and capacity
• On the number of independent sets in graphs with fixed independence number

Cited in

(2)

• Distributed broadcast in radio networks of unknown topology.
• scientific article; zbMATH DE number 3890728 (Why is no real title available?)

This page was built for publication: A note on counting very different sequences

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