paper

The edge-girth-regularity of Wenger graphs

arXiv:2311.04401

Abstract

Let be an integer and be a finite field of characteristic with elements. In this paper, it is proved that the Wenger graph and linearized Wenger graph are edge-girth-regular -graphs, and the parameter of graphs and is completely determined. Here, an edge-girth-regular graph means a -regular graph of order and girth satisfying that any edge is contained in distinct -cycles. As a direct corollary, we obtain the number of girth cycles of graph , and the lower bounds on the generalized Turán numbers and , where is the cycle of length and .Moreover, there exist a family of -graphs for odd, and the order of graph and extremal -graph have same asymptotic order for odd.

12 pages