Counting acyclic hypergraphs

来源 :中国科学:数学英文版 | 被引量 : 0次 | 上传用户:godkillboy
下载到本地 , 更方便阅读
声明 : 本文档内容版权归属内容提供方 , 如果您对本文有版权争议 , 可与客服联系进行内容授权或下架
论文部分内容阅读
Acyclic hypergraphs are analogues of forests in graphs. They arevery 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 formul
其他文献
For a birth and death process X = { X( t), t 【 σ } with explosion and lifespan a distributions and joint distributions of first hitting time and first hitting
This paper improves the method of discrete logarithm on anomalous elliptic curves, and establishes an isomorphism from E(Fp) to Fp which can be more easily impl
We give a necessary and sufficient condition for the nilpotent operators to be similiar to irreducible operators, and give an answer to D.A.Herrero Conjectures
Let (K, M) be a linear matrix problem induced from a finite dimensional algebra Λ. Then an n×n matrix M in R(K, M) is indecomposable if and only if the nu
Based on the method deriving dissipative compact linear schemes (DCS), novel high-order dissipative weighted compact nonlinear schemes (DWCNS) are developed. By
In this paper, a new trust region subproblem is proposed. The trust radius in the new subproblem adjusts itself adaptively. As a result, an adaptive trust regio
In the present paper, a liquid (or melt) film of relatively high temperature ejected from a vessel and painted on the moving solid film is analyzed by using the
A theorem of Block and Franke is improved on the existence of periodic points for a map of a circle to itself and a proof which seems more understandable is giv
The techniques from singularity theory are applied to the multiparameter bifurcation problem.The classification of (D4, S1)-equivariant bifurcation problems wit
Let L be a double homoclinic loop of a Hamiltonian system on the plane. We obtain a condition under which L generates at most two large limit cycles by perturba