Books versus Triangles near the n/6 Threshold
Kaizhe Chen, Jie Ma, Tianhen Wang

TL;DR
This paper proves a conjecture about the minimum number of triangles in large graphs with a given book number, confirming the structure of extremal graphs near the lower bound of the book number range.
Contribution
It establishes the conjecture for all book numbers between n/6 and (1/6 + epsilon)n, confirming the structure of extremal graphs in this range.
Findings
Confirmed the conjecture for all b in [n/6, (1/6 + epsilon)n]
Proved extremal graphs are close to a blow-up of the 3-prism
Established a stability theorem for the structure of extremal graphs
Abstract
The book number of a graph is the maximum number of triangles sharing a common edge. A strengthening of Mantel's theorem due to Rademacher states that every -vertex graph with more than edges contains at least triangles. Another strengthening, initiated by Erd\H{o}s, asserts that every such graph satisfies . Motivated by these results, Mubayi studied the tradeoff between the total number of triangles and the book number in such graphs, and asymptotically resolved the problem when . Conlon, Fox, and Sudakov conjectured that, for , every -vertex graph with at least edges and book number at most , other than the balanced complete bipartite graph, has at least triangles, with equality only for the blow-up of the -prism. They…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
