Counting acyclic hypergraphs

CSpace

	Counting acyclic hypergraphs
	Wang, JF; Li, HZ
	2001-02-01
发表期刊	SCIENCE IN CHINA SERIES A-MATHEMATICS PHYSICS ASTRONOMY
ISSN	1006-9283
卷号	44 期号:2 页码:220-224
摘要	Acyclic hypergraphs are analogues of forests in graphs. They are very useful in the design of databases. The number of distinct acyclic uniform hypergraphs with n labeled vertices is studied. With the aid of the principle of inclusion-exclusion, two formulas are presented. One is the explicit formula for strict ( d)-connected acyclic hypergraphs, the other is the recurrence formula for linear acyclic hypergraphs.
关键词	acyclic hypergraph enumeration of acyclic hypergraphs
语种	英语
WOS研究方向	Mathematics
WOS类目	Mathematics, Applied ; Mathematics
WOS记录号	WOS:000167195800009
出版者	SCIENCE PRESS
引用统计
文献类型	期刊论文
条目标识符	http://ir.amss.ac.cn/handle/2S8OKBNM/16557
专题	中国科学院数学与系统科学研究院
通讯作者	Wang, JF
作者单位	Chinese Acad Sci, Acad Math & Syst Sci, Inst Appl Math, Beijing 100080, Peoples R China
推荐引用方式 GB/T 7714	Wang, JF,Li, HZ. Counting acyclic hypergraphs[J]. SCIENCE IN CHINA SERIES A-MATHEMATICS PHYSICS ASTRONOMY,2001,44(2):220-224.
APA	Wang, JF,&Li, HZ.(2001).Counting acyclic hypergraphs.SCIENCE IN CHINA SERIES A-MATHEMATICS PHYSICS ASTRONOMY,44(2),220-224.
MLA	Wang, JF,et al."Counting acyclic hypergraphs".SCIENCE IN CHINA SERIES A-MATHEMATICS PHYSICS ASTRONOMY 44.2(2001):220-224.