The edge-girth-regularity of Wenger graphs
Abstract
Let n 1 be an integer and Fq be a finite field of characteristic p with q elements. In this paper, it is proved that the Wenger graph Wn(q) and linearized Wenger graph Lm(q) are edge-girth-regular (v,k,g,λ)-graphs, and the parameter λ of graphs Wn(q) and Lm(q) is completely determined. Here, an edge-girth-regular graph egr(v,k,g,λ) means a k-regular graph of order v and girth g satisfying that any edge is contained in λ distinct g-cycles. As a direct corollary, we obtain the number of girth cycles of graph Wn(q), and the lower bounds on the generalized Tur\'an numbers ex(n, C6, C5) and ex(n, C8, C7), where Ck is the cycle of length k and Ck = \C3, C4, … , Ck\.Moreover, there exist a family of egr(2q3,q,8,(q-1)3(q-2))-graphs for q odd, and the order of graph W2(q) and extremal egr(v,q,8,(q-1)3(q-2))-graph have same asymptotic order for q odd.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.