Triangles in Regular Graphs with Density Below One Half
Published online by Cambridge University Press: 01 May 2009
Let k3reg(n, d) be the minimum number of triangles in d-regular graphs with n vertices. We find the exact value of k3reg(n, d) for d between and n/2. In addition, we identify the structure of the extremal graphs.
- Copyright © Cambridge University Press 2009