The edge-girth-regularity of Wenger graphs
Combinatorics
2023-11-09 v1
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\'an 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.
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