当前位置: X-MOL 学术Discret. Math. › 论文详情
The average number of spanning hypertrees in sparse uniform hypergraphs
Discrete Mathematics ( IF 0.770 ) Pub Date : 2020-10-16 , DOI: 10.1016/j.disc.2020.112192
Haya S. Aldosari; Catherine Greenhill

An r-uniform hypergraph H consists of a set of vertices V and a set of edges whose elements are r-subsets of V. We define a hypertree to be a connected hypergraph which contains no cycles. A hypertree spans a hypergraph H if it is a subhypergraph of H which contains all vertices of H. Greenhill et al. (2017) gave an asymptotic formula for the average number of spanning trees in graphs with given, sparse degree sequence. We prove an analogous result for r-uniform hypergraphs with given degree sequence k=(k1,,kn). Our formula holds when r5kmax3=o((krkr)n), where k is the average degree and kmax is the maximum degree.

更新日期:2020-10-17

 

全部期刊列表>>
Springer 纳米技术权威期刊征稿
全球视野覆盖
施普林格·自然新
chemistry
3分钟学术视频演讲大赛
物理学研究前沿热点精选期刊推荐
自然职位线上招聘会
欢迎报名注册2020量子在线大会
化学领域亟待解决的问题
材料学研究精选新
GIANT
ACS ES&T Engineering
ACS ES&T Water
屿渡论文,编辑服务
ACS Publications填问卷
阿拉丁试剂right
麻省大学
西北大学
湖南大学
华东师范大学
王要兵
化学所
隐藏1h前已浏览文章
课题组网站
新版X-MOL期刊搜索和高级搜索功能介绍
ACS材料视界
天合科研
x-mol收录
陆军军医大学
杨财广
廖矿标
试剂库存
down
wechat
bug