On the counting formulas of hypergraphs and hyperblocks

MaRDI QIDQ3461005zbMATH OpenFDO

Authors Yufei Huang

Publication date 15 January 2016

zbMATH Keywords

\(k\)-uniformconnectedhyperblockhypergraphloop-free

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Hypergraphs (05C65)

Recommendations

• Enumeration of hypergraphs. I
• Enumeration of hypergraphs. I
• Enumeration of unlabeled uniform hypergraphs
• Enumeration of hypergraphs
• Counting acyclic hypergraphs

Cited in

(4)

• The counting of uniform acyclic hypergraphs
• scientific article; zbMATH DE number 4006293 (Why is no real title available?)
• On derivable trees
• Enumeration of hypergraphs. I

This page was built for publication: On the counting formulas of hypergraphs and hyperblocks

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