Answers are grounded in this paper and cite their sources.
We prove that the maximum number of triangles in a ‐free graph on vertices is at most , improving an estimate of Alon and Shikhelman.
No takes yet. Share an insight, caveat, or question.
Ergemlidze et al. (2018) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: