The maximum number of triangles in a graph and its applications to special $p$-groups

TL;DR

This paper establishes a sharp upper bound on the number of triangles in a graph with a fixed number of edges and applies this result to derive bounds on the size of certain special $p$-groups, linking graph theory and group theory.

Contribution

It provides a new maximum bound on the number of triangles in graphs with fixed edges and applies this to characterize bounds on special $p$-groups' properties, a novel connection between graph theory and group theory.

Findings

Derived a sharp bound on the maximum number of triangles in a graph with fixed edges.

Characterized graphs that achieve the maximum number of triangles.

Applied the bound to establish limits on the size of certain special $p$-groups.

Abstract

We give a sharp bound on the number of triangles in a graph with fixed number of edges. We also characterize graphs that achieve the maximum number of triangles. Using the upper bound on number of triangles, we prove that if $G$ is a special $p$-group of rank $2 \leq k \leq \binom{d}{2}$, then $|\mathcal{M}(G)| \leq p^{\frac{d(d+2k-1)}{2} - k- \binom{d}{3}+ \binom{r}{3} + \mybinom[.55]{ \binom{d}{2} - k - \binom{r}{2} }{2} }$, where $r$ is such that $\binom{r}{2} \leq \binom{d}{2} -k < \binom{r+1}{2} $. We also prove that, if $G$ is a $p$-group $(p \neq 2,3)$ of class $c \geq 3$, then $|\mathcal{M}(G)| \leq p^{\frac{d(m-e)}{2}+(\delta-1)(n-m)-\max(0,\delta-2)-\max(1,\delta-3)}$ and if $G$ is of coclass $r$ with class $c \geq 3$, then $|\mathcal{M}(G)| \leq p^{\frac{r^2-r}{2}+kr}$