Georgia Institute of Technology College of Sciences

The rank-$n$ Dowling geometry $Q_n(\Gamma)$ is a matroid associated with a graph edge-labeled by elements of the finite group $\Gamma$. We determine the maximum size of an $N$-free submatroid of $Q_n(\Gamma)$ for various choices of $N$, including subgeometries $Q_m(\Gamma')$, lines $U_{2,\ell}$, and graphic matroids $M(H)$. When the group $\Gamma$ is trivial and $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(K_4)$.

This is joint work with Rutger Campbell and Jorn van der Pol.