Abstract
AbstractWe prove that the maximum number of triangles in a ‐free graph on vertices is at most , improving an estimate of Alon and Shikhelman.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have