The Maximum Number of Triangles in a Graph of Given Maximum Degree
Abstract
We prove that any graph on n vertices with max degree d has at most qd+1 3+r 3 triangles, where n = q(d+1)+r, 0 r d. This resolves a conjecture of Gan-Loh-Sudakov.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.