English

Tur\'an's theorem for Dowling geometries

Combinatorics 2025-11-25 v2

Abstract

The Dowling geometry Qn(Γ)Q_n(\Gamma), where Γ\Gamma is a finite group, is a matroid that generalizes the complete-graphic matroid M(Kn+1)M(K_{n+1}). We determine the maximum size of an NN-free submatroid of Qn(Γ)Q_n(\Gamma) for various choices of NN, including subgeometries Qm(Γ)Q_m(\Gamma'), lines U2,U_{2,\ell}, and graphic matroids M(H)M(H). When the group Γ\Gamma is trivial and N=M(Kt)N=M(K_t), this problem reduces to Tur\'{a}n's classical result in extremal graph theory. We show that when Γ\Gamma is nontrivial, a complex dependence on Γ\Gamma emerges, even when N=M(K4)N=M(K_4).

Keywords

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

R2 v1 2026-07-01T05:10:24.507Z