报告题目：Characteristic polynomial of uniform hypertrees   

报告人：李红海（江西师范大学）

时间：2026年7月2日14:00-15:00

地点：5106

报告摘要：We express the characteristic polynomial of any uniform hypertree in terms of matching polynomials of its connected subtrees and some classical results in the literature are generalized to uniform hypergraphs and an elegant conjecture by Clark-Cooper can be resolved completely.