The counting series for unlabeled true strict (d)-connected acyclic hypergraphs

MaRDI QIDQ3054112zbMATH OpenFDO

Authors Muhuo Liu, Bolian Liu

Publication date 5 November 2010

zbMATH Keywords

hypergraphhypertreePólya enumeration theorem

Mathematics Subject Classification ID

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

Recommendations

• Counting acyclic hypergraphs
• The counting series for unlabeled linear acyclic hypergraphs.
• The counting of uniform acyclic hypergraphs
• Further study on sizes of acyclic hypergraphs
• The number of connected sparsely edged uniform hypergraphs

Cited in

(2)

• The counting of uniform acyclic hypergraphs
• The counting series for unlabeled linear acyclic hypergraphs.

This page was built for publication: The counting series for unlabeled true strict \((d)\)-connected acyclic hypergraphs

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