Two problems on booksize and triangular edges in Nosal graphs

Abstract

A graph $G$ with $m$ edges is said to be a Nosal graph if $ρ(G)>\sqrt{m}$. For a graph $G$, we write $bk(G)$ for its maximum book size and $τ(G)$ for the number of edges contained in triangles. Li, Liu and Zhang [J. Combin. Theory Ser. B 179 (2026) 219--249] proved that every $m$-edge Nosal graph satisfies $bk(G)> \frac{1}{24}\sqrt{m}$ and $τ(G) > \frac{1}{12}\sqrt{m}$. Recently, two results on the booksize constant are proved: $\frac{1}{9}$ by Zhai, Li and Lou [arXiv:2601.10163v2], and $\frac{1}{4}$ by Chen, Li and Tang [arXiv:2607.16746v1]. In this paper, we establish the following result: Every $m$-edge graph $G$ with no isolated vertices and $ρ(G)\geq \sqrt{m}$ that is not isomorphic to any complete bipartite graph satisfies $bk(G)\geq\frac{ρ(G)}{3}$ and $τ(G)\geq ρ(G)$. As direct consequences, we answer a question of Li, Liu and Zhang [J. Combin. Theory Ser. B 179 (2026) 219--249] and confirm a conjecture of Li, Feng and Peng [J. Graph Theory 110 (4) (2025) 408--425].

Disclosure

“1 graph G with ρ2 (G) > 2m(1 − t−1 ) satisfies τt (G) ≥ ct m? Funding This work is supported by the National Natural Science Foundation of China (Grant Nos. 12371347, 12271337). Acknowledgments The authors used an AI tool for exploratory discussions during the preparation of this work. All mathematical claims, proofs, and citations were independently reviewed, corrected, and approved by the authors, who take full responsibility for the final version of the”

PDF page 16

Classification

Citation assistance

Multiplier

2

Verified

2026-08-23T18:55:23.930796Z

Structural counts