English

The edge-girth-regularity of Wenger graphs

Combinatorics 2023-11-09 v1

Abstract

Let n1n\ge 1 be an integer and Fq\mathbb{F}_q be a finite field of characteristic pp with qq elements. In this paper, it is proved that the Wenger graph Wn(q)W_n(q) and linearized Wenger graph Lm(q)L_m(q) are edge-girth-regular (v,k,g,λ)(v,k,g,\lambda)-graphs, and the parameter λ\lambda of graphs Wn(q)W_n(q) and Lm(q)L_m(q) is completely determined. Here, an edge-girth-regular graph egr(v,k,g,λ)egr(v,k,g,\lambda) means a kk-regular graph of order vv and girth gg satisfying that any edge is contained in λ\lambda distinct gg-cycles. As a direct corollary, we obtain the number of girth cycles of graph Wn(q)W_n(q), and the lower bounds on the generalized Tur\'an numbers ex(n,C6,C5)ex(n, C_{6}, \mathscr{C}_{5}) and ex(n,C8,C7)ex(n, C_{8}, \mathscr{C}_{7}), where CkC_k is the cycle of length kk and Ck={C3,C4,,Ck}\mathscr{C}_k = \{C_3, C_4, \dots , C_k\}.Moreover, there exist a family of egr(2q3,q,8,(q1)3(q2))egr(2q^3,q,8,(q-1)^3(q-2))-graphs for qq odd, and the order of graph W2(q)W_2(q) and extremal egr(v,q,8,(q1)3(q2))egr(v,q,8,(q-1)^3(q-2))-graph have same asymptotic order for qq odd.

Keywords

Cite

@article{arxiv.2311.04401,
  title  = {The edge-girth-regularity of Wenger graphs},
  author = {Fuyuan Yang and Qiang Sun and Chao Zhang},
  journal= {arXiv preprint arXiv:2311.04401},
  year   = {2023}
}

Comments

12 pages

R2 v1 2026-06-28T13:14:42.470Z