Excluding a Line from Complex-Representable Matroids

被引：0
|
作者：
Geelen, Jim
Nelson, Peter
Walsh, Zach
机构：
来源：
MEMOIRS OF THE AMERICAN MATHEMATICAL SOCIETY | 2024年 / 303卷 / 1523期
关键词：
Matroids; MINOR-CLOSED CLASSES; BIASED GRAPHS; COMBINATORIAL GEOMETRIES; GF(3); OBSTRUCTIONS; FIELDS; NUMBER; GF(Q);
D O I：
10.1090/memo/1523
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
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.
引用
收藏
页数：104
相关论文
共 50 条
12345