Indexed metadata

Excluding a line from gammoids

Zhen Chen, Zhuo Li

Source record

Source: arXiv

Published: Sep 18, 2026

arXiv: 2609.21315

Open original source ↗

Source abstract

For all positive integers \ell and rr, we prove that a finite simple rank-rr gammoid with no U2,+2U_{2,\ell+2}-minor has at most (r1)+1\ell(r-1)+1 elements. This gives an affirmative answer to Problem~7.2 of Boretsky and Walsh [European J. Combin.\ 137 (2026), 104419], for both gammoids and transversal matroids. The bound is sharp for every \ell and rr. The key estimate is that, for every finite simple gammoid MM, the sum of L2|L|-2 over its long lines is at most E(M)r(M)|E(M)|-r(M).

Evidence graph

No public relationships recorded yet.

Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.