arXiv (All)
open access
On $k$-connected Sets in Matroids
In 1966, Tutte defined $k$-connected matroids for each $k \ge 2$. Robertson and Seymour built on Tutte's idea to define tangles as a way to identify highly connected parts of a matroid. Motivated by tangles, a set $Z$ in a matroid $M$ has been defined to be $3$-connected if, for each $j$ in $\{1,2\}
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
- Order and Gorenstein properties for lattice path matroid polytopes#820127
- Parameterized Enumeration of Minimal Defensive Alliances#1064528
- Maximal matroids and counterexamples#1200971
- Characterizing Steiner Systems via Betti Numbers of Monomial Ideals#1115739
- The crossing number and the unit-distance crossing number of the Hamming graphs H(d,3)=K_3^{box d}, and their realizations over many coordinate fields#1083260
Record · ID 1414659
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
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
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive