4 papers
Clique supersaturation under a chromatic constraint below the Turán threshold
Benju Wang, Longfei Fang, Jinlong Shu
A central theme in extremal graph theory is the supersaturation problem, which investigates the minimum number of copies of a target subgraph forced by prescribed edge conditions.…
On a spectral booksize problem fo non bipartite graphs
Benju Wang, Zhenzhen Lou, Jinlong Shu
The of a graph is the maximum number of triangles sharing a common edge. Motivated by a classical conjecture of Erdős, spectral lower bounds for the booksize hav…
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 obta…
Toughness in regular graphs from eigenvalues
Ruifang Liu, Ao Fan, Jinlong Shu
The {\it toughness} $Ï(G)=\mathrm{min}\{\frac{|S|}{c(G-S)}: S~\mbox{is a vertex cut in}~G\}$ for which was initially proposed by Chvátal in 1973. A graph is ca…