2000 character limit reached
Turán's theorem for Dowling geometries
Published 28 Aug 2025 in math.CO | (2508.20843v1)
Abstract: The Dowling geometry , where is a finite group, is a matroid that generalizes the complete-graphic matroid . We determine the maximum size of an -free submatroid of for various choices of , including subgeometries $Q_m(\Gamma')$, lines , and graphic matroids . When the group is trivial and , this problem reduces to Tur\'{a}n's classical result in extremal graph theory. We show that when is nontrivial, a complex dependence on emerges, even when .
Paper Prompts
Sign up for free to create and run prompts on this paper.