Author

Benju Wang

h-index 0 View on Semantic Scholar

We have 2 of 2 papers

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Preprint Aug 2026

On a spectral booksize problem fo non bipartite graphs

The $\text{bk}(G)$ of a graph $G$ is the maximum number of triangles sharing a common edge. Motivated by a classical conjecture of Erd\H{o}s, spectral lower bounds for the booksize have received considerable attention. For a positive divisor $s$ of $m-1$ with $\frac{m-1}{s}\ge2$, let $S_{m,s}^{+}$ be obtained from $K_{...

Benju Wang, Zhenzhen Lou, Jinlong Shu · 0 citations

Preprint Aug 2026

Clique supersaturation under a chromatic constraint below the Tur\'{a}n threshold

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. This line of research goes back to Rademacher and Erd\H{o}s for triangles, and was later extended to cliques by Lov\'asz and Simonovits in t...

Benju Wang, Longfei Fang, Jinlong Shu · 0 citations