Tight bounds on the coefficients of partition functions via stability.

Ewan Davies,Matthew Jenssen,Barnaby Roberts,Will Perkins

Electronic Notes in Discrete Mathematics（2018）

引用 3|浏览3

暂无评分

摘要

We show how to use the recently-developed occupancy method and stability results that follow easily from the method to obtain extremal bounds on the individual coefficients of the partition functions over various classes of bounded degree graphs.

查看译文

关键词

Partition function,stability,Upper Matching Conjecture

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要