Enumeration of maximum acyclic hypergraphs
From MaRDI portal
Publication:1862928
DOI10.1007/S102550200020zbMATH Open1014.05035OpenAlexW2057796604MaRDI QIDQ1862928FDOQ1862928
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
Recommendations
Cites Work
Cited In (11)
- On axioms constituting the foundation of hypergraph theory
- The counting of uniform acyclic hypergraphs
- Helly numbers of acyclic families
- The maximum number of Parter vertices of acyclic matrices
- Arboricity: an acyclic hypergraph decomposition problem motivated by database theory
- Maximum acyclic and fragmented sets in regular graphs
- Counting acyclic hypergraphs
- The \(\alpha \)-arboricity of complete uniform hypergraphs
- Further study on sizes of acyclic hypergraphs
- Acyclic sets of linear orders: a progress report
- Enumeration of hypergraphs. I
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)