Tur\'an's theorem for Dowling geometries
Abstract
The Dowling geometry Qn(), where is a finite group, is a matroid that generalizes the complete-graphic matroid M(Kn+1). We determine the maximum size of an N-free submatroid of Qn() for various choices of N, including subgeometries Qm('), lines U2,, and graphic matroids M(H). When the group is trivial and N=M(Kt), this problem reduces to Tur\'an's classical result in extremal graph theory. We show that when is nontrivial, a complex dependence on emerges, even when N=M(K4).
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.