2 citations · 2 across the 5 of their papers we have counts for
5 papers · 1 filter
Spectral Sidorenko inequalities and edge-spectral supersaturation
Yongtao Li, Wilson Lin, Hong Liu +1
We develop a spectral approach to Sidorenko-type inequalities and apply it to establish sharp edge-spectral supersaturation results. Let be a bipartite graph with vertices…
Chromatic thresholds for linear equations and recurrence
Hong Liu, Zhuo Wu, Ningyuan Yang +1
Motivated by classical problems in extremal graph theory, we study a chromatic analogue of Roth-type questions for linear equations over . Given a homogeneous equation…
Edge-spectral Turán theorems for color-critical graphs with applications
Yongtao Li, Hong Liu, Shengtong Zhang
A classical result of Nosal asserts that every -edge graph with spectral radius contains a triangle. A celebrated extension of Nikiforov [2002, CPC] states that…
An edge-spectral Erdős-Stone-Simonovits theorem and its stability
Yongtao Li, Hong Liu, Shengtong Zhang
We study the extremal problem that relates the spectral radius of an -free graph to its number of edges. Firstly, we prove that for any graph with chromatic numbe…
More on Nosal's spectral theorem: Books and -cycles
Yongtao Li, Hong Liu, Shengtong Zhang
Spectral graph theory studies how the eigenvalues of a graph relate to the structural properties of a graph. In this paper, we solve three open problems in spectral extremal graph…