Counting acyclic hypergraphs
type: Item
instance of: scholarly article
title: Counting acyclic hypergraphs
zbMATH Open document ID: 0999.05054
DOI: 10.1007/BF02874424
published in: Science in China. Series A
publication date: 2002-08-15T00:00:00Z
Mathematics Subject Classification ID: 05C30
Mathematics Subject Classification ID: 05C65
zbMATH DE Number: 1782081
zbMATH Keywords: enumeration
zbMATH Keywords: acyclic uniform hypergraphs
zbMATH Keywords: inclusion-exclusion
author: Jianfang Wang
author: Hai-zhu Li
MaRDI profile type: Publication
cites work: On the Desirability of Acyclic Database Schemes
cites work: An invariant for hypergraphs
cites work: Q4860774
cites work: The number of labeled k-dimensional trees
cites work: On the Number of Distinct Forests
full work available at URL: https://doi.org/10.1007/bf02874424
OpenAlex ID: W1491471968
Recommended article: Q3571238
Recommended article: Enumeration of maximum acyclic hypergraphs
Recommended article: Q3077212
Recommended article: Enumeration of hypergraphs
Recommended article: Q5456134
Recommended article: Counting extensional acyclic digraphs
Recommended article: On acyclic and cyclic hypergraphs
Recommended article: Counting hypergraphs with large girth
Recommended article: Q4521837
description: scientific article; zbMATH DE number 1782081