6 papers · 1 filter
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…
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 call…
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…
Spectral extremal results on trees
Longfei Fang, Huiqiu Lin, Jinlong Shu +1
Let be the maximum spectral radius over all -free graphs of order , and be the family of -free graphs of order with spectral radius…
Toughness and distance spectral radius in graphs involving minimum degree
Jing Lou, Ruifang Liu, Jinlong Shu
The toughness $τ(G)=\mathrm{min}\{\frac{|S|}{c(G-S)}: S~\mbox{is a cut set of vertices in}~G\}$ for The concept of toughness initially proposed by Chv$\mathrm{\acute…