The edge-girth-regularity of Wenger graphs
Fuyuan Yang, Qiang Sun, Chao Zhang

TL;DR
This paper proves that Wenger graphs and linearized Wenger graphs are edge-girth-regular, determines their parameters, and derives implications for cycle counts and Turán numbers, advancing understanding of their structural properties.
Contribution
It establishes that Wenger graphs and linearized Wenger graphs are edge-girth-regular and fully determines their parameters, providing new insights into their cycle structure and extremal properties.
Findings
Wenger graphs and linearized Wenger graphs are edge-girth-regular.
Parameters of these graphs are explicitly determined.
Derived bounds on generalized Turán numbers and cycle counts.
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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsFinite Group Theory Research · Coding theory and cryptography · Graph theory and applications
