Tur\'an's theorem for Dowling geometries
Combinatorics
2025-11-25 v2
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\'{a}n's classical result in extremal graph theory. We show that when is nontrivial, a complex dependence on emerges, even when .
Cite
@article{arxiv.2508.20843,
title = {Tur\'an's theorem for Dowling geometries},
author = {Rutger Campbell and Donggyu Kim and Jorn van der Pol},
journal= {arXiv preprint arXiv:2508.20843},
year = {2025}
}
Comments
18 pages; in this version, minor improvements were made to exposition and mathematics