Enumeration of maximum acyclic hypergraphs

DOI10.1007/S102550200020MaRDI QIDQ1862928zbMATH OpenOpenAlexFDO

Authors Hai-zhu Li, Jianfang Wang

Publication date 19 March 2003

Published in Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)

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

Mathematics Subject Classification ID

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

Recommendations

• Counting acyclic hypergraphs
• On acyclic and cyclic hypergraphs
• Paths and cycles of hypergraphs
• scientific article; zbMATH DE number 859448
• The counting series for unlabeled linear acyclic hypergraphs.

Cites work

• An invariant for hypergraphs
• scientific article; zbMATH DE number 3823168 (Why is no real title available?)
• Hypergraphs with cyclomatic number zero, triangulated graphs, and an inequality
• On the Desirability of Acyclic Database Schemes
• The number of labeled k-dimensional trees

Cited in

(11)

• Counting acyclic hypergraphs
• The maximum number of Parter vertices of acyclic matrices
• Helly numbers of acyclic families
• On axioms constituting the foundation of hypergraph theory
• Acyclic sets of linear orders: a progress report
• Further study on sizes of acyclic hypergraphs
• The -arboricity of complete uniform hypergraphs
• The counting of uniform acyclic hypergraphs
• Maximum acyclic and fragmented sets in regular graphs
• Enumeration of hypergraphs. I
• Arboricity: an acyclic hypergraph decomposition problem motivated by database theory

This page was built for publication: Enumeration of maximum acyclic hypergraphs

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