Entropy splitting hypergraphs

DOI10.1006/JCTB.1996.0024MaRDI QIDQ1924130zbMATH OpenOpenAlexFDO

Authors Gábor Simonyi

Publication date 23 June 1997

Published in Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/d0f2f85834828bd41c83e6b1519aec3a805e58c3

zbMATH Keywords

treeentropyhypergraph

Mathematics Subject Classification ID

Combinatorial probability (60C05) Hypergraphs (05C65)

Recommendations

• Split Hypergraphs
• Extremality of graph entropy based on degrees of uniform hypergraphs with few edges
• Graphs that Split Entropies
• Extremality of graph entropy based on Laplacian degrees of \(k\)-uniform hypergraphs
• On the number of edges in hypergraphs critical with respect to strong colourings

Cited in

(2)

• Graphs that Split Entropies
• Attempting perfect hypergraphs

This page was built for publication: Entropy splitting hypergraphs

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