The counting series for unlabeled linear acyclic hypergraphs.

zbMATH Open1164.05384MaRDI QIDQ5492616FDOQ5492616

Zhilong Shan, Bolian Liu

Publication date: 16 October 2006

zbMATH Keywords

hypergraphhypertreelinear hypergraphbipartite treePólya's enumeration theorem

Mathematics Subject Classification ID

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

Cited In (1)

• Enumeration of maximum acyclic hypergraphs

   Recommendations

• Counting acyclic hypergraphs 👍 👎
• Enumeration of unlabeled uniform hypergraphs 👍 👎
• The counting series for unlabeled true strict \((d)\)-connected acyclic hypergraphs 👍 👎
• Generating functions of some families of directed uniform hypergraphs 👍 👎
• Enumeration of unlabeled directed hypergraphs 👍 👎

This page was built for publication: The counting series for unlabeled linear acyclic hypergraphs.

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