Excluding a Line from Complex-Representable Matroids

For each positive integer t and each sufficiently large integer r , we show that the maximum number of elements of a simple, rank-r, C- representable matroid with no U 2,t+3-minor is t( r ) + r . We derive this as a consequence of a much more general 2 result concerning matroids on group-labeled graphs.