Counting acyclic hypergraphs

DOI10.1007/BF02874424zbMATH Open0999.05054OpenAlexW1491471968MaRDI QIDQ1609631FDOQ1609631

Authors: Jianfang Wang, Hai-zhu Li 

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

Recommendations

• The counting of uniform acyclic hypergraphs
• Enumeration of maximum acyclic hypergraphs
• Acyclic numbers of graphs
• Enumeration of hypergraphs
• scientific article; zbMATH DE number 5260735
• Counting extensional acyclic digraphs
• On acyclic and cyclic hypergraphs
• Counting hypergraphs with large girth
• scientific article; zbMATH DE number 1547736

zbMATH Keywords

enumerationinclusion-exclusionacyclic uniform hypergraphs

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• On the Desirability of Acyclic Database Schemes
• The number of labeled k-dimensional trees
• An invariant for hypergraphs
• On the Number of Distinct Forests

Cited In (13)

• Multinerves and Helly numbers of acyclic families
• On axioms constituting the foundation of hypergraph theory
• The counting of uniform acyclic hypergraphs
• Helly numbers of acyclic families
• The Complexity of Acyclic Subhypergraph Problems
• Arboricity: an acyclic hypergraph decomposition problem motivated by database theory
• The counting series for unlabeled true strict \((d)\)-connected acyclic hypergraphs
• Further study on sizes of acyclic hypergraphs
• Enumeration of maximum acyclic hypergraphs
• Counting acyclic and strong digraphs by descents
• The counting series for unlabeled linear acyclic hypergraphs.
• Counting enriched multigraphs according to the number of their edges (or arcs)
• On the discovery of the cycle-axiom of hypergraphs

This page was built for publication: Counting acyclic hypergraphs

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