2 citations · 2 across the 20 of their papers we have counts for
7 papers · 1 filter
Edge-spectral supersaturation for tripartite color-critical graphs
Longfei Fang, Huiqiu Lin, Mingqing Zhai
We study edge-spectral supersaturation for two families of color-critical graphs with chromatic number three. For an integer , we define the spectral threshold \[ g_r(m):=…
Minimally -edge-connected graphs via spectral radius
Yu Wang, Dan Li, Huiqiu Lin
For , the -edge-connectivity of a connected graph is defined as the minimum number of edges whose removal leaves a graph with at least components. A gra…
Spectral extremal results for triangle-free graphs with chromatic number at least four
Yinfen Zhu, Huiqiu Lin
A graph is called -free if it does not contain a copy of . Let denote a -free graph of order with chromatic number at least that maximizes the spect…
Spectral radius, toughness and -factor of graphs
Yuanyuan Chen, Huiqiu Lin, Shucheng Li
A -regular spanning subgraph of is called a -factor. Fan, Lin and Lu [European J. Combin. 110 (2023) 103701] presented a tight sufficient condition in terms of the spectr…
Counting color-critical subgraphs under Nikiforov's condition
Longfei Fang, Huiqiu Lin, Mingqing Zhai
For a graph with edges, let be its spectral radius, and let denote the number of copies of in . Nikiforov [Combin. Probab.\,Comput., 2002] proved tha…
More on spectral supersaturation for the bowtie
Longfei Fang, Yongtao Li, Huiqiu Lin
A central topic in extremal graph theory is the supersaturation problem, which studies the minimum number of copies of a fixed substructure that must appear in any graph with more…
Spectral extremal graphs on closed surfaces of fixed Euler genus
Mingqing Zhai, Longfei Fang, Huiqiu Lin
Graph theory on surfaces extends classical graph structures to topological surfaces, providing a theoretical foundation for characterizing the embedding properties of complex netwo…