图的最大三角形数及其对特殊$p$ -群的应用
The maximum number of triangles in a graph and its applications to special $p$-groups
摘要:
本文给出了边数固定的图中三角形个数的一个精确界。我们还描述了实现最大三角形数量的图。利用三角形个数的上界,证明了若$G$是秩为$2 \leq k \leq \binom{d}{2}$的特殊$p$ -群,则有$|\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} }$,其中$r$使得$\binom{r}{2} \leq \binom{d}{2} -k < \binom{r+1}{2} $ .我们还证明了,如果$G$是类$c \geq 3$的$p$ -群$(p \neq 2,3)$,则$|\mathcal{M}(G)| \leq p^{\frac{d(m-e)}{2}+(δ-1)(n-m)-\max(0,δ-2)-\max(1,δ-3)}$和如果$G$是类$c \geq 3$的共类$r$,则$|\mathcal{M}(G)| \leq p^{\frac{r^2-r}{2}+kr}$
英文摘要:
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}+(δ-1)(n-m)-\max(0,δ-2)-\max(1,δ-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}$
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。