BIMSA >
图的结构、谱与图上几何分析
图的结构、谱与图上几何分析
The extremal spectral radius of uniform hypergraphs avoiding a given structure
The extremal spectral radius of uniform hypergraphs avoiding a given structure
Organizer
Speaker
Wenhuan Wang
Time
Wednesday, October 14, 2026 3:00 PM - 4:00 PM
Venue
Online
Online
Tencent 482 969 7386
(106457)
Abstract
The spectral analogue of the Tur\'{a}n-type problem for linear $r$-uniform hypergraphs is considered. In this talk, we present some new results about the hypergraphs with the maximum spectral radii among the set of connected linear $k$-uniform hypergraphs on $n$ vertices without the expansion of a path of length 4, the connected outerplanar 3-uniform hypergraphs on $n$ vertices without Berge-$P_k$, and the linear outerplanar 3-uniform hypergraphs on $n$ vertices without a cycle of length three, etc.
Speaker Intro
王文环，上海大学副教授, 在图论及其应用领域发表了多篇学术论文，研究方向涉及图的能量排序、超树谱半径、Estrada指数、符号拉普拉斯系数等.