Counting acyclic hypergraphs

DOI10.1007/BF02874424zbMath0999.05054OpenAlexW1491471968MaRDI QIDQ1609631

Hai-zhu Li, Jian-fang Wang

Publication date: 15 August 2002

Published in: Science in China. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02874424

zbMATH Keywords

enumerationinclusion-exclusionacyclic uniform hypergraphs

Mathematics Subject Classification ID

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

Related Items (3)

On the discovery of the cycle-axiom of hypergraphs ⋮ On axioms constituting the foundation of hypergraph theory ⋮ The Complexity of Acyclic Subhypergraph Problems

Cites Work

• An invariant for hypergraphs
• On the Desirability of Acyclic Database Schemes
• On the Number of Distinct Forests
• The number of labeled k-dimensional trees
• Unnamed Item

This page was built for publication: Counting acyclic hypergraphs