Showing 2026Show all
2 papers · 1 filter
math.CO2026
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.…
math.CO2026
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…