activity
20222026
most citedLinear spectral Turan problems for expansions of graphs with given chromatic number

4 citations · 7 across the 14 of their papers we have counts for

collaborators

14 papers

math.CO2026

Tensor Spectral Stability for Uniform Hypergraphs with Bounded Matching Number

Yi Xu, Yi-Zheng Fan

We establish a tensor spectral stability theorem for uniform hypergraphs with bounded matching number. More precisely, for fixed integers and , and sufficiently l…

math.CO2026

Degree Majorization and Laplacian Eigenvalue Sums for Simplicial Complexes

Huan-Zhi Zhang, Yi-Min Song, Yi-Zheng Fan

Let be an -dimensional simplicial complex. We prove that the spectrum of its -dimensional up-Laplacian is majorized by the conjugate degree sequence of its $(r - 1)…

math.CO2026

Signless Laplacian Spectral Radius and Link Homology of Simplicial Complexes

Yi-Zheng Fan, Huan-Zhi Zhang

In this paper, we study the signless Laplacian spectral radius of pure simplicial complexes under local homological restrictions on links. Let be a pure -dimensional complex…

math.CO2026

Upper Bounds for the Largest Laplacian Eigenvalue of Simplicial Complexes

Huan-Zhi Zhang, Yi-Zheng Fan

Let be a finite -dimensional simplicial complex with vertex set of size . We study the largest eigenvalue of the combinatorial -up Laplacian $L^{\operatorname{…

math.CO2026

Orthogonal degree-similarity of edge-deleted strongly regular graphs

Yi-Zheng Fan, Wei Wang, Kuo Zhang

Godsil and Sun asked whether, for a strongly regular graph and any two different edges and , the edge-deleted graphs and are degree-similar…

math.CO2026

Smith normal forms for coalescences at cospectral vertices

Yi-Zheng Fan, Kuo Zhang, Wei Wang

Let be the generalized -adjacency matrix of a finite graph . Fan, Xing, Zhang, and Wang constructed pairs of non-degree-similar trees for which the Smith…

math.CO2026

Generalized spectral Turán problems for disjoint cliques

Yi Xu, Yi-Zheng Fan

The generalized Turán number denotes the maximum number of copies of in an -vertex -free graph. Let be the disjoint union of copies of…

math.CO2026

Signless Laplacian spectral radius of simplicial complexes without -dimensional wheels

Huan-Zhi Zhang, Yi-Zheng Fan

An -dimensional wheel is defined as the join of an -simplex and a cycle. In this paper, we study the maximum signless Laplacian spectral radius of -vertex -dimensio…

math.CO2026

Maximizing the signless Laplacian spectral radius of simplicial 2-complexes with a prescribed second Betti number

Chuan-Ming She, Yi-Zheng Fan, Yi-Min Song

We study how a prescribed second Betti number constrains the largest eigenvalue of the signless Laplacian on edges of a pure two-dimensional simplicial complex. For each fixed posi…

math.CO2025

Signless Laplacian spectral radius of simplicial complexes without holes

Yi-Zheng Fan, Chuan-Ming She, Huan-Zhi Zhang

We study a spectral analog of the Turán problem for simplicial complexes. Specifically, we consider the extremal problem of maximizing the signless Laplacian spectral radius among…

math.CO2024★ 1 cited

The largest normalized Laplacian eigenvalue and incidence balancedness of simplicial complexes

Yi-min Song, Hui-Feng Wu, Yi-Zheng Fan

Let be a simplicial complex, and let be the -th up normalized Laplacian of . Horak and Jost showed that the largest eigenvalue of is at most $…

math.CO2024★ 2 cited

Spectral bipartite Turan problems on linear hypergraphs

Chuan-Ming She, Yi-Zheng Fan, Liying Kang

Let be a graph, and let be the class of -uniform Berge- hypergraphs. In this paper, we establish a relationship between the spectral radius of the adja…

math.CO2023

Hypergraph coverings and Ramanujan Hypergraphs

Yi-Min Song, Yi-Zheng Fan, Zhengke Miao

In this paper we investigate Ramanujan hypergraphs by using hypergraph coverings. We first show that the spectrum of a -fold covering of a connected hypergraph con…

math.CO2022★ 4 cited

Linear spectral Turan problems for expansions of graphs with given chromatic number

Chuan-Ming She, Yi-Zheng Fan, Liying Kang +1

An -uniform hypergraph is linear if every two edges intersect in at most one vertex. The -expansion of a graph is the -uniform hypergraph obtained from by…