2 citations · 2 across the 20 of their papers we have counts for
5 papers · 1 filter
Spectral supersaturation for color-critical graphs
Longfei Fang, Yongtao Li, Huiqiu Lin +1
A graph is color-critical if it contains an edge whose deletion reduces its chromatic number. This class of graphs, including cliques and odd cycles, plays a central role in extrem…
A note on the spectral radius and -factor of graphs
Dandan Fan, Huiqiu Lin, Yinfen Zhu
The investigation of eigenvalue conditions for the existence of an -factor originates in the work of Brouwer and Haemers (2005) on perfect matchings. In the decades since, s…
Non-bipartite graphs without theta subgraphs
Longfei Fang, Huiqiu Lin
Fix a color-critical graph with . Simonovits' chromatic critical edge theorem and Nikiforov's spectral chromatic critical edge theorem imply that is t…
On the Turán number of odd-ballooning of -chromatic graphs
Longfei Fang, Xueyi Huang, Huiqiu Lin +1
Given a graph , the Turán number is the maximum number of edges in any -vertex -free graph. The odd-ballooning of , denoted by , is a graph obtai…
The spectral Turán problem: Characterizing spectral-consistent graphs
Longfei Fang, Sergey Goryainov, Denis Krotov +2
Let and denote the families of -free graphs of order with maximum size and maximum spectral radius, respectively. A graph is called spe…