Conceptio › Archive › arXiv (All)
arXiv (All) open access

Excluding a line from gammoids

Chen, Zhen et al.
arXiv (All) · Papers
Open Source ↗Direct PDF ↓
05b35combinatorics
For all positive integers $\ell$ and $r$, we prove that a finite simple rank-$r$ gammoid with no $U_{2,\ell+2}$-minor has at most $\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
Conceptio Open Archive

Analyze & explore related research in Conceptio

Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.

This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗

Related documents

Record · ID 1035722
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive