Zhiheng Zheng

most citedOn the multicolor Turán conjecture for color-critical graphs

1 citations · 1 across the 3 of their papers we have counts for

collaborators

3 papers

math.CO2026

On Spielman's Laplacian Eigenratio Conjecture and Related Problems

Jie Ma, Quanyu Tang, Yuchang Wang +1

Let $G$ be an $n$ -vertex graph with Laplacian eigenvalues $0 = λ_{1} (G) \leq λ_{2} (G) \leq \dots \leq λ_{n} (G)$ . Motivated by the Alon-Boppana bound and the Ramanujan phenomenon for regular grap…

math.CO2026

Hypergraphs without Subgraphs of Given Connectivity

Jie Ma, Shengjie Xie, Zhiheng Zheng

In this paper, we study the problem of determining the maximum number $F_{r} (n, k)$ of edges in an $n$ -vertex $r$ -uniform hypergraph that contains no $(k + 1)$ -connected subgraph. The g…

math.CO2024★ 1 cited

On the multicolor Turán conjecture for color-critical graphs

Xihe Li, Jie Ma, Zhiheng Zheng

A {\it simple $k$ -coloring} of a multigraph $G$ is a decomposition of the edge multiset as a disjoint sum of $k$ simple graphs which are referred as colors. A subgraph $H$ of a mul…