paper

Turán's theorem for Dowling geometries

arXiv:2508.20843

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 , lines , and graphic matroids . When the group is trivial and , this problem reduces to Turán's classical result in extremal graph theory. We show that when is nontrivial, a complex dependence on emerges, even when .

18 pages; in this version, minor improvements were made to exposition and mathematics

Turán's theorem for Dowling geometries · wovepaper