Hostname: page-component-74656f9884-rdgjk Total loading time: 0 Render date: 2026-11-07T10:06:17.398Z Has data issue: false hasContentIssue false

Triangles in Regular Graphs with Density Below One Half

Published online by Cambridge University Press:  01 May 2009

ALLAN SIU LUN LO*
Affiliation:
Department of Pure Mathematics and Mathematical Statistics, University of Cambridge, Cambridge CB3 0WB, UK (e-mail: allan.lo@cantab.net)
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

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 $2n /5 + 12 \sqrt{n}/5$ and n/2. In addition, we identify the structure of the extremal graphs.

Information

Type
Paper
Copyright
Copyright © Cambridge University Press 2009