arXiv (All)
open access
Tree packing and the graphic Additive Base Conjecture
Tutte's flow conjectures ask when a graph has a nowhere-zero flow with small integer values. We approach these questions through spanning-tree packing. A common analytic argument recovers Seymour's six-flow theorem, the three-flow theorem for six-edge-connected graphs, and the four-flow theorem for
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
- Every tree on $n$ edges decomposes $K_{nx,nx}$ and $K_{2nx+1}$#821666
- Counting Triangles in Graph Streams with Repeatable and Forgettable Edges#1014988
- A counterexample to the wrapping number conjecture#1084415
- Block-Coordinate Frank-Wolfe for Structural SVMs#284430
- Cayley-graph density of Thompson's group F: local deletions and finite-window bounds#1011214
Record · ID 1216409
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