4 papers
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 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…