Indexed metadata
Excluding a line from gammoids
Zhen Chen, Zhuo Li
Source abstract
For all positive integers and , we prove that a finite simple rank- gammoid with no -minor has at most 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 and . The key estimate is that, for every finite simple gammoid , the sum of over its long lines is at most .
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.