The counting of uniform acyclic hypergraphs

zbMATH Open1212.05130MaRDI QIDQ3571238FDOQ3571238

Bolian Liu, Muhuo Liu

Publication date: 8 July 2010

zbMATH Keywords

hypertreeuniform hypergraphhyperforests

Mathematics Subject Classification ID

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

Cited In (5)

• Multinerves and Helly numbers of acyclic families
• Helly numbers of acyclic families
• Generating functions of some families of directed uniform hypergraphs
• Counting acyclic hypergraphs
• Further study on sizes of acyclic hypergraphs

   Recommendations

• Counting acyclic hypergraphs 👍 👎
• The counting series for unlabeled linear acyclic hypergraphs. 👍 👎
• The counting series for unlabeled true strict \((d)\)-connected acyclic hypergraphs 👍 👎
• Enumeration of maximum acyclic hypergraphs 👍 👎
• Title not available (Why is that?) 👍 👎

This page was built for publication: The counting of uniform acyclic hypergraphs

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